LOQO: An interior point code for quadratic programming

被引:199
作者
Vanderbei, RJ [1 ]
机构
[1] Princeton Univ, Princeton, NJ 08544 USA
基金
美国国家科学基金会;
关键词
D O I
10.1080/10556789908805759
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
This paper describes a software package, called LOQO, which implements a primal-dual 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 was 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.
引用
收藏
页码:451 / 484
页数:34
相关论文
共 39 条
  • [1] Andersen E.D., 1996, Implementation of interior point methods for large scale linear programming, P189
  • [2] [Anonymous], J SEMANTICS
  • [3] BOGGS PT, 1991, NISTIR4556
  • [4] BREITFELD MG, 1994, LARGE SCALE OPTIMIZATION: STATE OF THE ART, P45
  • [5] CONN AR, CONSTRAINED UNCONSTR
  • [6] SOLVING SYMMETRICAL INDEFINITE SYSTEMS IN AN INTERIOR-POINT METHOD FOR LINEAR-PROGRAMMING
    FOURER, R
    MEHROTRA, S
    [J]. MATHEMATICAL PROGRAMMING, 1993, 62 (01) : 15 - 39
  • [7] Gay D.M., 1985, MATH PROGRAMMING SOC, V13, P10
  • [8] THE EVOLUTION OF THE MINIMUM DEGREE ORDERING ALGORITHM
    GEORGE, A
    LIU, JWH
    [J]. SIAM REVIEW, 1989, 31 (01) : 1 - 19
  • [9] PRECONDITIONERS FOR INDEFINITE SYSTEMS ARISING IN OPTIMIZATION
    GILL, PE
    MURRAY, W
    PONCELEON, DB
    SAUNDERS, MA
    [J]. SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1992, 13 (01) : 292 - 311
  • [10] GILL PE, 1991, 917 SOL STANF U