Download:
by Yuri G. Evtushenko, Vitali, G. Zhadan
Optimization Methods and Software
http://isir.ras.ru/ph/0006/U0DHBZ3K.PDF
Add To MetaCart
Abstract:
Dedicated to Professor George B. Dantzig on the occasion of his eightieth birthday. Abstract. The present paper is devoted to the application of the space transformation techniques for solving linear programming problems. By using a surjective mapping the original constrained optimization problem is transformed to a problem in a new space with only equality constraints. For the numerical solution of the latter problem the stable version of the gradient-projection and Newton’s methods are used. After an inverse transformation to the original space a family of numerical methods for solving optimization problems with equality and inequality constraints is obtained. The proposed algorithms are based on the numerical integration of the systems of ordinary differential equations. These algorithms do not require feasibility of the starting and current points, but they preserve feasibility. As a result of a space transformation the vector fields of differential equations are changed and additional terms are introduced which serve as a barrier preventing the trajectories from leaving the feasible set. A proof of a convergence is given. Keywords: Linear programming, space transformation, gradient-projection method, Newton’s method, interior point technique, barrier function, Karmarkar’s method.
Citations
|
686
|
and Nonlinear Programming
– Luenberger, Linear
- 1984
|
|
457
|
A new polynomial-time algorithm for linear programming
– Karmarkar
- 1984
|
|
279
|
Constrained Optimization and Lagrange Multiplier Methods. Athena Scientific
– Bertsekas
- 1996
|
|
230
|
Nonlinear programming: Sequential Unconstrained Minimization Techniques
– Fiacco, McCormick
- 1990
|
|
175
|
On the implementation of a (primal-dual) interior point method
– Mehrotra
- 1992
|
|
117
|
Pathways to the optimal set in linear programming
– Megiddo
- 1989
|
|
108
|
Path following methods for linear programming
– Gonzaga
|
|
89
|
Iterative solutions of problems of linear and quadratic programming
– Dikin
- 1967
|
|
75
|
The gradient projection method for nonlinear programming, Part II, nonlinear constraints
– Rosen
- 1961
|
|
55
|
A variation on Karmarkar’s algorithm for solving linear programming problems
– Barnes
- 1986
|
|
49
|
A modification of Karmarkar's linear programming algorithm", Algorithmica 1
– Vanderbei, Meketon, et al.
- 1986
|
|
48
|
An implementation of Karmarkar's algorithm for linear programming", Mathematical Programming 44
– Adler, Resende, et al.
- 1989
|
|
45
|
The nonlinear geometry of linear programming. III. Projective Legendre transform coordinates and Hilbert geometry
– Bayer, Lagarias
- 1990
|
|
35
|
An implementation of a primal-dual interior point method for linear programming
– McShane, Monma, et al.
- 1989
|
|
30
|
A primal-dual interior point method for linear programming
– Kojima, Mizuno, et al.
- 1989
|
|
30
|
A quadratically convergent O( √ nL)–iteration algorithm for linear programming
– Ye, Güler, et al.
- 1993
|
|
17
|
On the superlinear and quadratic convergence of primal-dual interior point linear programming algorithms
– Zhang, Tapia, et al.
- 1992
|
|
10
|
Hamiltonian structure of dynamical systems which solve linear programming problems
– Faybusovich
- 1991
|
|
8
|
An implementation of the method of analytic centers
– Sonnevend
- 1988
|
|
7
|
Dynamical systems which solve optimization problems with linear constraints
– Faybusovich
- 1991
|
|
6
|
A geometric method in nonlinear programming
– Tanabe
- 1980
|
|
4
|
Numerical Optimization Techniques
– Evtushenko
- 1985
|
|
4
|
A relaxation method for solving problems of non-linear programming
– Zhadan
- 1977
|
|
4
|
A quadratically convergent method for linear programming
– Herzel, Recchioni, et al.
- 1991
|
|
3
|
Local stability of nonlinear control systems
– Bacciotti
- 1992
|
|
3
|
Two numerical methods of solving nonlinear programming problems
– Evtushenko
- 1974
|
|
3
|
Numerical methods for solving some operations research problems
– Zhadan
- 1973
|
|
3
|
Barrier-projective and barrier-Newton numerical methods in optimization (the linear programming case
– Evtushenko, Zhadan
- 1991
|
|
1
|
New approaches in optimization techniques
– Zhadan
- 1989
|
|
1
|
The space transformation techniques in mathematical programming
– Zhadan
- 1992
|
|
1
|
On gradient projection for linear programming”, Working Paper 94, Yale School of Organization and Management
– Kallio
- 1986
|
|
1
|
An interior point method for linear programming
– Wei
- 1987
|
|
1
|
Application of the method of Lyapunov functions to the study of the convergence of numerical methods
– Evtushenko, Zhadan
- 1975
|
|
1
|
Convergence of barrier-projection methods of optimization via vector Lyapunov functions, to appear in: Optimization Methods and Software
– Smirnov
|
|
1
|
Complexity of the barrier-Newton method in linear programming
– Smirnov
|
|
1
|
On two classes of methods for solving nonlinear programming problems
– Zhadan
- 1980
|
|
1
|
On gradient projection for linear programming", Working Paper 94, Yale School of Organization and Management
– Kallio
- 1986
|
