Newton methods for nonsmooth convex minimization: connections among U-Lagrangian, Riemannian Newton and SQP methods - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Mathematical Programming Year : 2005

Newton methods for nonsmooth convex minimization: connections among U-Lagrangian, Riemannian Newton and SQP methods

Abstract

This paper studies Newton-type methods for minimization of partly smooth convex functions. Sequential Newton methods are provided using local parameterizations obtained from U-Lagrangian theory and from Riemannian geometry. The Hessian based on the U-Lagrangian depends on the selection of a dual parameter g; by revealing the connection to Riemannian geometry, a natural choice of g emerges for which the two Newton directions become identical. This choice of g is also shown to be related to the least-squares multiplier estimate from a sequential quadratic programming (SQP) approach, and with this multiplier, SQP gives the same search direction as the Newton methods.
Fichier principal
Vignette du fichier
MM05.pdf (261.16 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00071403 , version 1 (23-05-2006)
inria-00071403 , version 2 (25-03-2013)

Identifiers

Cite

Scott A. Miller, Jérôme Malick. Newton methods for nonsmooth convex minimization: connections among U-Lagrangian, Riemannian Newton and SQP methods. Mathematical Programming, 2005, 104, ⟨10.1007/s10107-005-0631-2⟩. ⟨inria-00071403v2⟩

Collections

INRIA INRIA2
131 View
576 Download

Altmetric

Share

Gmail Facebook X LinkedIn More