The multiproximal linearization method for convex composite problems
From MaRDI portal
Publication:2191762
DOI10.1007/s10107-019-01382-3zbMath1445.90081arXiv1712.02623OpenAlexW2963414688WikidataQ128166977 ScholiaQ128166977MaRDI QIDQ2191762
Jérôme Bolte, Zheng Chen, Edouard Pauwels
Publication date: 26 June 2020
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.02623
complexityconvex optimizationcomposite optimizationfirst order methodsprox-linear methodproximal Gauss-Newton's method
Convex programming (90C25) Minimax problems in mathematical programming (90C47) Nonlinear programming (90C30)
Related Items
Harnessing Structure in Composite Nonsmooth Minimization, Efficiency of higher-order algorithms for minimizing composite functions, 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, High-Order Optimization Methods for Fully Composite Problems, Primal superlinear convergence of SQP methods in piecewise linear-quadratic composite optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A proximal method for composite minimization
- A dual method for minimizing a nonsmooth objective over one smooth inequality constraint
- Minimizing finite sums with the stochastic average gradient
- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- Evolution problem associated with a moving convex set in Hilbert space
- The value function approach to convergence analysis in composite optimization
- A Gauss-Newton method for convex composite optimization
- Convergence analysis of a proximal Gauss-Newton method
- An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming
- Efficiency of minimizing compositions of convex functions and smooth maps
- Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions
- On the complexity of finding first-order critical points in constrained nonlinear optimization
- Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs
- Accelerated and Inexact Forward-Backward Algorithms
- Proximal Splitting Methods in Signal Processing
- A Moving Balls Approximation Method for a Class of Smooth Constrained Minimization Problems
- On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- Majorizing Functions and Convergence of the Gauss–Newton Method for Convex Composite Optimization
- Descent methods for composite nondifferentiable optimization problems
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- A model algorithm for composite nondifferentiable optimization problems
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Variational Analysis
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- The linearization method
- Iterative Solution of Nonlinear Equations in Several Variables
- Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
- Systems of Structured Monotone Inclusions: Duality, Algorithms, and Applications
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Signal Recovery by Proximal Forward-Backward Splitting
- Proximité et dualité dans un espace hilbertien
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
- Convex analysis and monotone operator theory in Hilbert spaces
- On convergence of the Gauss-Newton method for convex composite optimization.
