A Noninterior Continuation Method for Quadratic and Linear Programming
- 1 August 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 3 (3), 503-515
- https://doi.org/10.1137/0803024
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A Non-Interior-Point Continuation Method for Linear Complementarity ProblemsSIAM Journal on Matrix Analysis and Applications, 1993
- An Implementation of a Primal-Dual Interior Point Method for Linear ProgrammingINFORMS Journal on Computing, 1989
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- A Primal-Dual Interior Point Algorithm for Linear ProgrammingPublished by Springer Nature ,1989
- Progress in Mathematical ProgrammingPublished by Springer Nature ,1989
- Iterative Methods for Large Convex Quadratic Programs: A SurveySIAM Journal on Control and Optimization, 1987
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- A dual differentiable exact penalty functionMathematical Programming, 1983
- Iterative Solution of Linear ProgramsSIAM Journal on Numerical Analysis, 1981
- Nonlinear Perturbation of Linear ProgramsSIAM Journal on Control and Optimization, 1979