Envelope functions: unifications and further properties
From MaRDI portal
Abstract: Recently, the forward-backward and Douglas-Rachford envelope functions were proposed in the literature. The stationary points of these envelope functions have a close relationship with the solutions of the possibly nonsmooth optimization problem to be solved. The envelopes were shown to be smooth and convex under some additional assumptions. Therefore, these envelope functions create powerful bridges between nonsmooth and smooth optimization. In this paper, we present a general envelope function that unifies and generalizes these envelope functions. We provide properties of the general envelope function that sharpen corresponding known results for the special cases. We also present an envelope function for the generalized alternating projections method (GAP), named the GAP envelope. It enables for convex feasibility problems with two sets, of which one is affine, to be solved by finding any stationary point of the smooth and under some assumptions convex GAP envelope.
Recommendations
- Further properties of the forward-backward envelope with applications to difference-of-convex programming
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- Convergence rates of forward-Douglas-Rachford splitting method
- Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
- Monotone operator theory and splitting methods
Cites work
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3229228 (Why is no real title available?)
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A three-operator splitting scheme and its optimization applications
- Analysis of the Inexact Uzawa Algorithm for Saddle Point Problems
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- Functional Operators (AM-22), Volume 2
- Introductory lectures on convex optimization. A basic course.
- Linear Convergence and Metric Selection for Douglas-Rachford Splitting and ADMM
- Metric selection in fast dual forward-backward splitting
- Nonlinear Inexact Uzawa Algorithms for Linear and Nonlinear Saddle-point Problems
- On general minimax theorems
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Optimal Parameter Selection for the Alternating Direction Method of Multipliers (ADMM): Quadratic Problems
- Optimization and nonsmooth analysis
- Preconditioning techniques for large linear systems: A survey
- Proximité et dualité dans un espace hilbertien
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- The method of projections for finding the common point of convex sets
- Tight global linear convergence rate bounds for Douglas-Rachford splitting
- Variational Analysis
Cited in
(11)- On envelopes and backward approximations
- ENVELOPES FOR SETS AND FUNCTIONS: REGULARIZATION AND GENERALIZED CONJUGACY
- scientific article; zbMATH DE number 1985546 (Why is no real title available?)
- Further properties of the forward-backward envelope with applications to difference-of-convex programming
- An accelerated coordinate gradient descent algorithm for non-separable composite optimization
- scientific article; zbMATH DE number 7289906 (Why is no real title available?)
- scientific article; zbMATH DE number 704314 (Why is no real title available?)
- Smoothing unadjusted Langevin algorithms for nonsmooth composite potential functions
- Coordinate descent methods beyond smoothness and separability
- From Eckart and Young approximation to Moreau envelopes andvice versa
- An envelope for Davis-Yin splitting and strict saddle-point avoidance
This page was built for publication: Envelope functions: unifications and further properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1730819)
