Optimization Online


Proximal Methods for Nonlinear Programming: Double Regularization and Inexact Subproblems

Jonathan Eckstein(jeckstei***at***rci.rutgers.edu)
Paulo J.S. Silva(pjssilva***at***ime.usp.br)

Abstract: This paper describes the first phase of a project attempting to construct an efficient general-purpose nonlinear optimizer using an augmented Lagrangian outer loop with a relative error criterion, and an inner loop employing a state-of-the art conjugate gradient solver. The outer loop can also employ double regularized proximal kernels, a fairly recent theoretical development that leads to fully smooth subproblems. We first enhance the existing theory to show that our approach is globally convergent in both the primal and dual spaces when applied to convex problems. We then present an extensive computational evaluation using the CUTE test set, showing that some aspects of our approach are promising, but some are not. These conclusions in turn lead to additional computational experiments suggesting where to next focus our theoretical and computational efforts.

Keywords: Proximal methods, nonlinear programming, augmented Lagrangians

Category 1: Nonlinear Optimization (Constrained Nonlinear Optimization )

Category 2: Convex and Nonsmooth Optimization (Convex Optimization )

Citation: RUTCOR Research Report RRR 17-2008, RUTCOR, Rutgers University, November 2008

Download: [PDF]

Entry Submitted: 11/06/2008
Entry Accepted: 11/06/2008
Entry Last Modified: 11/06/2008

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society