Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/inria-00071403
Contributor : Jérôme Malick <>
Submitted on : Monday, March 25, 2013 - 2:25:26 PM
Last modification on : Wednesday, June 30, 2021 - 11:58:06 AM
Long-term archiving on: : Wednesday, June 26, 2013 - 4:01:31 AM

File

MM05.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

245

Files downloads

624