A VMiPG method for composite optimization with nonsmooth term having no closed-form proximal mapping (Q6639509)

scientific article; zbMATH DE number 7945520

Language	Label	Description	Also known as
English	A VMiPG method for composite optimization with nonsmooth term having no closed-form proximal mapping	scientific article; zbMATH DE number 7945520

Statements

instance of

scholarly article

0 references

title

A VMiPG method for composite optimization with nonsmooth term having no closed-form proximal mapping (English)

0 references

0 references

0 references

0 references

Journal of Scientific Computing

0 references

publication date

15 November 2024

0 references

zbMATH Keywords

nonconvex and nonsmooth composite optimization

0 references

variable metric inexact PG method

0 references

global convergence

0 references

linear convergence rate

0 references

KL property

0 references

MaRDI profile type

Publication

0 references

cites work

Robust inversion, dimensionality reduction, and randomized sampling

0 references

On the convergence of the proximal algorithm for nonsmooth functions involving analytic features

0 references

Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality

0 references

Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence

0 references

Incorporating prior information with fused sparse group lasso: Application to prediction of clinical measures from neuroimages

0 references

Tame functions are semismooth

0 references

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

Variable metric inexact line-search-based methods for nonsmooth optimization

0 references

On the convergence of a linesearch based proximal-gradient method for nonconvex optimization

0 references

An abstract convergence framework with application to inertial inexact forward-backward methods

0 references

Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope

0 references

New convergence results for the inexact variable metric forward-backward method

0 references

Inertial Variable Metric Techniques for the Inexact Forward--Backward Algorithm

0 references

Optimization Methods for Large-Scale Machine Learning

0 references

An inexact successive quadratic approximation method for L-1 regularized optimization

0 references

On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm''

0 references

An introduction to continuous optimization for imaging

0 references

Convergence Rates in Forward--Backward Splitting

0 references

Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function

0 references

Q3996569

0 references

Variable metric forward–backward splitting with applications to monotone inclusions in duality

0 references

Geometric categories and o-minimal structures

0 references

Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates

0 references

ADMM for High-Dimensional Sparse Penalized Quantile Regression

0 references

Q5251797

0 references

An Invitation to Tame Optimization

0 references

Globalized inexact proximal Newton-type methods for nonconvex composite functions

0 references

Penalized maximum likelihood image restoration with positivity constraints: multiplicative algorithms

0 references

Inexact successive quadratic approximation for regularized optimization

0 references

Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods

0 references

A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems

0 references

On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems

0 references

Efficient Sparse Semismooth Newton Methods for the Clustered Lasso Problem

0 references

An inexact regularized proximal Newton method for nonconvex and nonsmooth optimization

0 references

A globally convergent proximal Newton-type method in nonsmooth convex optimization

0 references

Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices

0 references

A new steplength selection for scaled gradient methods with application to image deblurring

0 references

A nonsmooth version of Newton's method

0 references

Convex Analysis

0 references

Variational Analysis

0 references

Nonlinear total variation based noise removal algorithms

0 references

The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions

0 references

Forward-backward quasi-Newton methods for nonsmooth optimization problems

0 references

Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms

0 references

Sparsity and Smoothness Via the Fused Lasso

0 references

Composite Self-Concordant Minimization

0 references

A New Homotopy Proximal Variable-Metric Framework for Composite Convex Minimization

0 references

Accelerated and inexact forward-backward algorithms

0 references

Kurdyka-Łojasiewicz exponent via inf-projection

0 references

A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property

0 references

Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1007/S10915-024-02712-0

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6639509