ABSTRACT. This paper describes a software package, called LOQO, which implements a primaldual interior-point method for general nonlinear programming. We focus in this paper mainly on the algorithm as it applies to linear and quadratic programming with only brief mention of the extensions to convex and general nonlinear programming, since a detailed paper describing these extensions were published recently elsewhere. In particular, we emphasize the importance of establishing and maintaining symmetric quasidefiniteness of the reduced KKT system. We show that the industry standard MPS format can be nicely formulated in such a way to provide quasidefiniteness. Computational results are included for a variety of linear and quadratic programming problems. 1.
|
259
|
Primal-Dual Interior-Point Methods
– WRIGHT
- 1997
|
|
175
|
On the implementation of a (primal-dual) interior point method
– Mehrotra
- 1992
|
|
130
|
Interior path following primal-dual algorithms
– Monteiro, Adler
- 1989
|
|
120
|
Electronic Mail Distribution of Linear Programming Test Problems
– Gay
- 1985
|
|
117
|
Pathways to the optimal set in linear programming
– Megiddo
- 1989
|
|
110
|
Interior point methods for linear programming: Computational state of the art
– Lustig, Marsten, et al.
- 1994
|
|
108
|
The evolution of the minimum degree ordering algorithm
– George, Liu
- 1989
|
|
97
|
CUTE: constrained and unconstrained testing environments
– BONGARTZ, CONN, et al.
- 1995
|
|
94
|
An interior-point algorithm for nonconvex nonlinear programming
– Shanno, Vanderbei
- 1999
|
|
71
|
Computational Experience with a Primaldual Interior Point Method for Linear Programming
– Lustig, Marsten, et al.
- 1989
|
|
51
|
On Implementing Mehrotra’s Predictor-Corrector Interior-Point Method for Linear Programming
– Lustig, Marsden, et al.
- 1992
|
|
50
|
An infeasible-interior-point algorithm for linear complementarity problems
– Wright
- 1993
|
|
46
|
Preconditioners for indefinite systems arising in optimization
– Gill, Murray, et al.
- 1992
|
|
43
|
A primal-dual infeasible-interiorpoint algorithm for linear programming
– Kojima, Megiddo, et al.
- 1993
|
|
43
|
Symmetric indefinite systems for interior point methods
– Vanderbei, Carpenter
- 1993
|
|
36
|
Symmetric quasi-definite matrices
– Vanderbei
- 1995
|
|
29
|
Sparse matrix technology
– Pissanetzky
- 1984
|
|
28
|
Solving symmetric indefinite systems in an interior-point method for linear programming
– Fourer, Mehrotra
- 1993
|
|
23
|
Implementation of interior point methods for large scale linear programming
– Meszaros, Xu
- 1996
|
|
23
|
A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
– Potra
- 1994
|
|
22
|
Feasibility issues in a primal-dual interior-point method for linear programming
– Lustig
- 1990
|
|
22
|
On implementing Mehrotra's predictor-corrector interior point method for linear programming
– Lustig, Marsten, et al.
- 1992
|
|
21
|
Programming: Foundations and Extensions
– Linear
- 1998
|
|
18
|
Solving reduced KKT systems in barrier methods for linear and quadratic programming
– Gill, Murray, et al.
- 1991
|
|
14
|
A repository of convex quadratic programming problems’, Optimization Methods and Software
– Maros, Meszaros
- 1999
|
|
14
|
Interior point methods : Algorithms and formulations
– Vanderbei
- 1994
|
|
9
|
Preliminary computational experience with modified log-barrier functions for large-scale nonlinear programming
– Breitfeld, Shanno
- 1993
|
|
9
|
Interior-point methods for linear and nonlinear programming
– Shanno, Simantiraki
- 1997
|
|
9
|
Computing projections for the Karmarkar algorithm
– Turner
- 1991
|
|
9
|
On the convergence of a class of infeasible-interior-point methods for the horizontal linear complementarity problem
– Zhang
- 1994
|
|
7
|
An interior-point method for linear and quadratic programming problems
– Boggs, Domich, et al.
- 1991
|
|
7
|
Primal-dual methods in linear programming
– Gill, Murray, et al.
- 1991
|
|
5
|
Centered newton method for linear programming: exterior point method (in japanese
– Tanabe
- 1990
|
|
4
|
An algorithmic and numerical comparison of several interior-point methods
– Vanderbei, Duarte, et al.
- 1994
|
|
2
|
On superlinear convergence of infeasible-interior-point algorithms for linearly constrained convex programs
– Monteiro, Zhou
- 1997
|
|
2
|
A predictor-corrector-O3D formulation for quadratic programming
– Rogers, Boggs, et al.
- 1994
|
|
2
|
Affine scaling and linear programs with free variables
– Vanderbei
- 1989
|
|
1
|
On the sparsity issues of interior point methods for quadratic programming
– Meszaros
- 1998
|
|
1
|
An implementation of the minimum-degree algorithm using simple data structures
– Vanderbei
- 1990
|
|
1
|
Electronic mail distributionof linear programming test problems
– Gay
- 1985
|
|
