K-K-T multiplier estimates and objective function lower bounds from projective SUMT
From MaRDI portal
(Redirected from Publication:1316100)
Recommendations
Cites work
- A class of methods for unconstrained minimization based on stable numerical integration techniques
- A differential equation approach to nonlinear programming
- A general method for solving constrained optimization problems
- A Newton-type curvilinear search method for constrained optimization
- A Newton-type curvilinear search method for optimization
- An approach to nonlinear programming
- An implementation of Karmarkar's algorithm for linear programming
- Constrained optimization along geodesics
- Differential gradient methods
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- Linear programming and the Newton barrier flow
- ODE versus SQP methods for constrained optimization
- Power Series Variants of Karmarkar-Type Algorithms
- Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
- 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
This page was built for publication: K-K-T multiplier estimates and objective function lower bounds from projective SUMT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1316100)