Skip to main content
Log in

Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods

  • Published:
Mathematical Programming Submit manuscript

Abstract.

The paper extends prior work by the authors on loqo, an interior point algorithm for nonconvex nonlinear programming. The specific topics covered include primal versus dual orderings and higher order methods, which attempt to use each factorization of the Hessian matrix more than once to improve computational efficiency. Results show that unlike linear and convex quadratic programming, higher order corrections to the central trajectory are not useful for nonconvex nonlinear programming, but that a variant of Mehrotra’s predictor-corrector algorithm can definitely improve performance.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: May 3, 1999 / Accepted: January 24, 2000¶Published online March 15, 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shanno, D., Vanderbei, R. Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods. Math. Program. 87, 303–316 (2000). https://doi.org/10.1007/s101070050116

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s101070050116

Navigation