Further properties of the forward-backward envelope with applications to difference-of-convex programming
From MaRDI portal
Publication:2364125
DOI10.1007/s10589-017-9900-2zbMath1400.90279arXiv1605.00201OpenAlexW2962871487WikidataQ57511139 ScholiaQ57511139MaRDI QIDQ2364125
Publication date: 18 July 2017
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.00201
Related Items
An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems, Forward-backward quasi-Newton methods for nonsmooth optimization problems, Proximal gradient algorithms under local Lipschitz gradient continuity. A convergence and robustness analysis of PANOC, Kurdyka-Łojasiewicz exponent via inf-projection, Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints, Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm, Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems, Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints, Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity, Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope, Fast L1-L2 minimization via a proximal operator, A proximal difference-of-convex algorithm with extrapolation, Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results, The modified second APG method for DC optimization problems, ℓ 1 − αℓ 2 minimization methods for signal and image reconstruction with impulsive noise removal, A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima, The Dantzig selector: recovery of signal via ℓ 1 − αℓ 2 minimization, Convergence of an Inertial Shadow Douglas-Rachford Splitting Algorithm for Monotone Inclusions
Cites Work
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- On local convergence of the method of alternating projections
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- Efficient evaluation of scaled proximal operators
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- The Moreau envelope function and proximal mapping in the sense of the Bregman distance
- A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- A coordinate gradient descent method for nonsmooth separable minimization
- Error bounds and convergence analysis of feasible descent methods: A general approach
- An algorithm for total variation minimization and applications
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- An alternating direction method for finding Dantzig selectors
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- Proximal Newton-Type Methods for Minimizing Composite Functions
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- A semismooth Newton method for Tikhonov functionals with sparsity constraints
- Decoding by Linear Programming
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- Numerical Optimization
- On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization
- Variational Analysis
- Bregman Monotone Optimization Algorithms
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Sparse Reconstruction by Separable Approximation
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A Semismooth Newton Method with Multidimensional Filter Globalization for $l_1$-Optimization
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Penalty Methods for a Class of Non-Lipschitz Optimization Problems
- Convex analysis and monotone operator theory in Hilbert spaces
- Compressed sensing
