Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems (Q6182324)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems

scientific article; zbMATH DE number 7794708

Language	Label	Description	Also known as
default for all languages	No label defined
English	Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems	scientific article; zbMATH DE number 7794708

Statements

instance of

scholarly article

0 references

title

Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems (English)

0 references

published in

Journal of Optimization Theory and Applications

0 references

publication date

25 January 2024

0 references

full work available at URL

https://arxiv.org/abs/1711.06831

0 references

zbMATH Keywords

proximal gradient method

0 references

extrapolation

0 references

non-monotone

0 references

line search

0 references

stationary point

0 references

KL property

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Difference-of-convex learning: directional stationarity, optimality, and sparsity

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

Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Templates for convex cone problems with applications to sparse signal recovery

0 references

Nonmonotone Spectral Projected Gradient Methods on Convex Sets

0 references

The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems

0 references

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

An introduction to continuous optimization for imaging

0 references

Smoothing methods for nonsmooth, nonconvex minimization

0 references

Penalty methods for a class of non-Lipschitz optimization problems

0 references

Proximal splitting methods in signal processing

0 references

On the nonmonotone line search

0 references

Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

0 references

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

0 references

A generalized proximal point algorithm for certain non-convex minimization problems

0 references

Accelerated gradient methods for nonconvex nonlinear and stochastic programming

0 references

A Nonmonotone Line Search Technique for Newton’s Method

0 references

Group sparse optimization via \(\ell_{p,q}\) regularization

0 references

Asymptotic properties of bridge estimators in sparse high-dimensional regression models

0 references

Asymptotics for Lasso-type estimators.

0 references

A proximal method for composite minimization

0 references

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

0 references

Splitting Algorithms for the Sum of Two Nonlinear Operators

0 references

A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems

0 references

Further properties of the forward-backward envelope with applications to difference-of-convex programming

0 references

Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms

0 references

Q3320132

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Gradient methods for minimizing composite functions

0 references

Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization

0 references

iPiano: inertial proximal algorithm for nonconvex optimization

0 references

Adaptive restart for accelerated gradient schemes

0 references

Variational Analysis

0 references

Q4864293

0 references

Approximation accuracy, gradient methods, and error bound for structured convex optimization

0 references

Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems

0 references

A proximal difference-of-convex algorithm with extrapolation

0 references

Sparse Reconstruction by Separable Approximation

0 references

A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion

0 references

Block stochastic gradient iteration for convex and nonconvex optimization

0 references

A globally convergent algorithm for nonconvex optimization based on block coordinate update

0 references

A nonmonotone alternating updating method for a class of matrix factorization problems

0 references

Minimization of \(\ell_{1-2}\) for compressed sensing

0 references

Nearly unbiased variable selection under minimax concave penalty

0 references

A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

10.1007/S10957-023-02348-4

0 references

Sitelinks

Mathematics(1 entry)

mardi Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems