Interior-Point Methods for Nonconvex Nonlinear Programming: Regularization and Warmstarts

H.Y. Benson (bensondrexel.edu)
D.F. Shanno (shannorutcor.rutgers.edu)

Abstract: In this paper, we investigate the use of an exact primal-dual penalty approach within the framework of an interior-point method for nonconvex nonlinear programming. This approach provides regularization and relaxation, which can aid in solving ill-behaved problems and in warmstarting the algorithm. We present details of our implementation within the LOQO algorithm and provide extensive numerical results on the CUTEr test set and on warmstarting in the context of nonlinear, mixed integer nonlinear, and goal programming.

Keywords: interior-point methods, nonlinear programming, warmstarting, penalty methods

Category 1: Nonlinear Optimization (Constrained Nonlinear Optimization )

Citation: Working paper, November 2005.

Download: [PDF]

Entry Submitted: 11/04/2005
Entry Accepted: 11/04/2005
Entry Last Modified: 11/04/2005

Modify/Update this entry