Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1040.90564
Vanderbei, Robert J.; Shanno, David F.
An interior-point algorithm for nonconvex nonlinear programming. (English)
[J] Comput. Optim. Appl. 13, No. 1-3, 231-252 (1999). ISSN 0926-6003; ISSN 1573-2894/e

Summary: The paper describes an interior-point algorithm for nonconvex nonlinear programming which is a direct extension of interior-point methods for linear and quadratic programming. Major modifications include a merit function and an altered search direction to ensure that a descent direction for the merit function is obtained. Preliminary numerical testing indicates that the method is robust. Further, numerical comparisons with MINOS and LANCELOT show that the method is efficient, and has the promise of greatly reducing solution times on at least some classes of models.

MSC 2000:: *90C51 Interior-point methods
90C30 Nonlinear programming
90C55 Methods of successive quadratic programming type

Keywords: nonlinear programming; interior-point methods; nonconvex optimization

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]