Harnessing structure in composite nonsmooth minimization
Preprint
Abstract
We consider the problem of minimizing the composition of a nonsmooth function with a smooth mapping in the case where the proximity operator of the nonsmooth function can be explicitly computed. We first show that this proximity operator can provide the exact smooth substructure of minimizers, not only of the nonsmooth function, but also of the full composite function. We then exploit this proximal identification by proposing an algorithm which combines proximal steps with sequential quadratic programming steps. We show that our method locally identifies the optimal smooth substructure and then converges quadratically. We illustrate its behavior on two problems: the minimization of a maximum of quadratic functions and the minimization of the maximal eigenvalue of a parametrized matrix.Keywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Accelerating inexact successive quadratic approximation for regularized optimization through manifold identificationMathematical Programming, 2023
- Newton acceleration on manifolds identified by proximal gradient methodsMathematical Programming, 2022
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteriaMathematical Programming, 2019
- The multiproximal linearization method for convex composite problemsMathematical Programming, 2019
- A proximal method for composite minimizationMathematical Programming, 2015
- Composite proximal bundle methodMathematical Programming, 2012
- Nonsmooth optimization via quasi-Newton methodsMathematical Programming, 2012
- Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methodsMathematical Programming, 2005
- Introduction to Smooth Manifolds2003
- An algorithm for composite nonsmooth optimization problemsJournal of Optimization Theory and Applications, 1986