A VMiPG method for composite optimization with nonsmooth term having no closed-form proximal mapping
DOI10.1007/S10915-024-02712-0MaRDI QIDQ6639509
Shaohua Pan, Taiwei Zhang, Ruyu Liu
Publication date: 15 November 2024
Published in: Journal of Scientific Computing (Search for Journal in Brave)
global convergencelinear convergence rateKL propertynonconvex and nonsmooth composite optimizationvariable metric inexact PG method
Mathematical programming (90Cxx) Numerical methods in optimal control (49Mxx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx)
Cites Work
- Nonlinear total variation based noise removal algorithms
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An inexact successive quadratic approximation method for L-1 regularized optimization
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- Robust inversion, dimensionality reduction, and randomized sampling
- A new steplength selection for scaled gradient methods with application to image deblurring
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Tame functions are semismooth
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Geometric categories and o-minimal structures
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Globalized inexact proximal Newton-type methods for nonconvex composite functions
- Kurdyka-Łojasiewicz exponent via inf-projection
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- A nonsmooth version of Newton's method
- Inexact successive quadratic approximation for regularized optimization
- New convergence results for the inexact variable metric forward-backward method
- A globally convergent proximal Newton-type method in nonsmooth convex optimization
- An abstract convergence framework with application to inertial inexact forward-backward methods
- Variable metric inexact line-search-based methods for nonsmooth optimization
- Accelerated and inexact forward-backward algorithms
- Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- An Invitation to Tame Optimization
- Convergence Rates in Forward--Backward Splitting
- Variational Analysis
- On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems
- Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms
- A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems
- Optimization Methods for Large-Scale Machine Learning
- Sparsity and Smoothness Via the Fused Lasso
- Inertial Variable Metric Techniques for the Inexact Forward--Backward Algorithm
- Penalized maximum likelihood image restoration with positivity constraints: multiplicative algorithms
- A New Homotopy Proximal Variable-Metric Framework for Composite Convex Minimization
- Incorporating prior information with fused sparse group lasso: Application to prediction of clinical measures from neuroimages
- Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope
- Efficient Sparse Semismooth Newton Methods for the Clustered Lasso Problem
- On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence
- On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
- The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions
- Variable metric forward–backward splitting with applications to monotone inclusions in duality
- Composite Self-Concordant Minimization
- Convex Analysis
- An introduction to continuous optimization for imaging
- Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound
- An inexact regularized proximal Newton method for nonconvex and nonsmooth optimization
- ADMM for High-Dimensional Sparse Penalized Quantile Regression
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: A VMiPG method for composite optimization with nonsmooth term having no closed-form proximal mapping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6639509)