The multiproximal linearization method for convex composite problems
From MaRDI portal
Abstract: Composite minimization involves a collection of smooth functions which are aggregated in a nonsmooth manner. In the convex setting, we design an algorithm by linearizing each smooth component in accordance with its main curvature. The resulting method, called the Multiprox method, consists in solving successively simple problems (e.g. constrained quadratic problems) which can also feature some proximal operators. To study the complexity and the convergence of this method we are led to study quantitative qualification conditions to understand the impact of multipliers on the complexity bounds. We obtain explicit complexity results of the form involving new types of constant terms. A distinctive feature of our approach is to be able to cope with oracles involving moving constraints. Our method is flexible enough to include the moving balls method, the proximal Gauss-Newton's method, or the forward-backward splitting, for which we recover known complexity results or establish new ones. We show through several numerical experiments how the use of multiple proximal terms can be decisive for problems with complex geometries.
Recommendations
- A proximal method for composite minimization
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems
- Composite proximal bundle method
- A proximal-based deomposition method for compositions method for convex minimization problems
- Proximal Newton-type methods for minimizing composite functions
Cites work
- A dual method for minimizing a nonsmooth objective over one smooth inequality constraint
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Gauss-Newton method for convex composite optimization
- A model algorithm for composite nondifferentiable optimization problems
- A moving balls approximation method for a class of smooth constrained minimization problems
- A proximal method for composite minimization
- Accelerated and inexact forward-backward algorithms
- An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Convergence analysis of a proximal Gauss-Newton method
- Convex analysis and monotone operator theory in Hilbert spaces
- Descent methods for composite nondifferentiable optimization problems
- Efficiency of minimizing compositions of convex functions and smooth maps
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- Error bounds, quadratic growth, and linear convergence of proximal methods
- Evolution problem associated with a moving convex set in Hilbert space
- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Iterative Solution of Nonlinear Equations in Several Variables
- Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
- Majorizing Functions and Convergence of the Gauss–Newton Method for Convex Composite Optimization
- Minimizing finite sums with the stochastic average gradient
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- On convergence of the Gauss-Newton method for convex composite optimization.
- On the complexity of finding first-order critical points in constrained nonlinear optimization
- On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming
- Proximal splitting methods in signal processing
- Proximité et dualité dans un espace hilbertien
- Signal Recovery by Proximal Forward-Backward Splitting
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Systems of Structured Monotone Inclusions: Duality, Algorithms, and Applications
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
- The linearization method
- The value function approach to convergence analysis in composite optimization
- Variational Analysis
Cited in
(16)- A proximal-based deomposition method for compositions method for convex minimization problems
- An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization
- Primal superlinear convergence of SQP methods in piecewise linear-quadratic composite optimization
- Efficiency of minimizing compositions of convex functions and smooth maps
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems
- A parallel line search subspace correction method for composite convex optimization
- Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications
- Analysis and algorithms for some compressed sensing models based on L1/L2 minimization
- Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems
- PARTIAL PROXIMAL METHOD OF MULTIPLIERS FOR CONVEX PROGRAMMING PROBLEMS
- High-order optimization methods for fully composite problems
- Harnessing Structure in Composite Nonsmooth Minimization
- Efficiency of higher-order algorithms for minimizing composite functions
- Moving higher-order Taylor approximations method for smooth constrained minimization problems
- Accelerated first-order optimization under nonlinear constraints
- Iterative linear quadratic optimization for nonlinear control: differentiable programming algorithmic templates
This page was built for publication: The multiproximal linearization method for convex composite problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2191762)
