|
Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2013, Volume 19, Number 2, Pages 98–108
(Mi timm936)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
Generalized Newton method for linear optimization problems with inequality constraints
A. I. Golikov, Yu. G. Evtushenko Dorodnitsyn Computing Centre of the Russian Academy of Sciences
Abstract:
A dual problem of linear programming (LP) is reduced to the unconstrained maximization of a concave piecewise quadratic function for sufficiently large values of a certain parameter. An estimate is given for the threshold value of the parameter starting from which the projection of a given point on the set of solutions of the dual LP problem in dual and auxiliary variables is easily found by means of a single solution of an unconstrained maximization problem. The unconstrained maximization is carried out by the generalized Newton method, which is globally convergent in a finite number of steps. The results of numerical experiments are presented for randomly generated large-scale LP problems.
Keywords:
linear programming problem, piecewise quadratic function, unconstrained maximization, generalized Newton method.
Received: 11.02.2013
Citation:
A. I. Golikov, Yu. G. Evtushenko, “Generalized Newton method for linear optimization problems with inequality constraints”, Trudy Inst. Mat. i Mekh. UrO RAN, 19, no. 2, 2013, 98–108; Proc. Steklov Inst. Math. (Suppl.), 284, suppl. 1 (2014), 96–107
Linking options:
https://www.mathnet.ru/eng/timm936 https://www.mathnet.ru/eng/timm/v19/i2/p98
|
|