K-K-T multiplier estimates and objective function lower bounds from projective SUMT
From MaRDI portal
Publication:1316100
DOI10.1016/0167-6377(93)90053-JzbMath0789.90077MaRDI QIDQ1316100
Roger L. Tobin, Terry L. Friesz, Nihal J. Mehta
Publication date: 12 June 1994
Published in: Operations Research Letters (Search for Journal in Brave)
Cites Work
- Unnamed Item
- A general method for solving constrained optimization problems
- Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
- ODE versus SQP methods for constrained optimization
- Linear programming and the Newton barrier flow
- Constrained optimization along geodesics
- A Newton-type curvilinear search method for optimization
- Differential gradient methods
- A class of methods for unconstrained minimization based on stable numerical integration techniques
- A Newton-type curvilinear search method for constrained optimization
- An implementation of Karmarkar's algorithm for linear programming
- An approach to nonlinear programming
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
- The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
- The Projective SUMT Method for Convex Programming
- A differential equation approach to nonlinear programming
- Power Series Variants of Karmarkar-Type Algorithms