tlooto
Sign up
Computer ScienceMathematics

An Interior-Point Algorithm for Nonconvex Nonlinear Programming

R. Vanderbei, D. Shanno

1999.4.1COMPUTATIONAL OPTIMIZATION AND APPLICATIONS

DOI: 10.1023/a:1008677427361

tlooto Summary

Numerical comparisons with MINOS and LANCELOT show that the interior-point algorithm for nonconvex nonlinear programming is efficient, and has the promise of greatly reducing solution times on at least some classes of models.

Abstract

Abstract is not available.

Citation format

VANDERBEI, R.; SHANNO, D. An interior-point algorithm for nonconvex nonlinear programming. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 1999, 13: 231–252.