A new proximal heavy ball inexact line-search algorithm (Q6541375)

scientific article; zbMATH DE number 7850973

Language	Label	Description	Also known as
English	A new proximal heavy ball inexact line-search algorithm	scientific article; zbMATH DE number 7850973

Statements

instance of

scholarly article

0 references

title

A new proximal heavy ball inexact line-search algorithm (English)

0 references

0 references

0 references

0 references

Computational Optimization and Applications

0 references

publication date

17 May 2024

0 references

zbMATH Keywords

forward-backward methods

0 references

inertial methods

0 references

line-search

0 references

nonconvex optimization

0 references

MaRDI profile type

Publication

0 references

cites work

Dynamical systems and forward–backward algorithms associated with the sum of a convex subdifferential and a monotone cocoercive operator

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

The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than \(1/k^2\)

0 references

A Dynamical Approach to an Inertial Forward-Backward Algorithm for Convex Minimization

0 references

Convergence Rates of the Heavy Ball Method for Quasi-strongly Convex Optimization

0 references

Two-Point Step Size Gradient 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

A spectral conjugate gradient method for unconstrained optimization

0 references

Inexact 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

Explainable bilevel optimization: an application to the Helsinki Deblur Challenge

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

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

An algorithm for total variation minimization and applications

0 references

Q3078296

0 references

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

0 references

A Stochastic Majorize-Minimize Subspace Algorithm for Online Penalized Least Squares Estimation

0 references

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

0 references

Proximal Splitting Methods in Signal Processing

0 references

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

0 references

Signal Recovery by Proximal Forward-Backward Splitting

0 references

Hybrid limited memory gradient projection methods for box-constrained optimization problems

0 references

Barzilai–Borwein-like rules in proximal gradient schemes for ℓ <sub>1</sub> -regularized problems

0 references

Q5479892

0 references

Inexact successive quadratic approximation for regularized optimization

0 references

From differential equation solvers to accelerated first-order methods for convex optimization

0 references

Smooth minimization of non-smooth functions

0 references

Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano

0 references

iPiasco: inertial proximal algorithm for strongly convex optimization

0 references

iPiano: Inertial Proximal Algorithm for Nonconvex Optimization

0 references

Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems

0 references

Q3028166

0 references

Some methods of speeding up the convergence of iteration methods

0 references

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

0 references

Scaled, Inexact, and Adaptive Generalized FISTA for Strongly Convex Optimization

0 references

Convex Analysis

0 references

Variational Analysis

0 references

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

0 references

Q4903682

0 references

A coordinate gradient descent method for nonsmooth separable minimization

0 references

Accelerated and inexact forward-backward algorithms

0 references

The bound-constrained conjugate gradient method for non-negative matrices

0 references

Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems

0 references

Q3149262

0 references

Efficient gradient projection methods for edge-preserving removal of Poisson noise

0 references

Identifiers

zbMATH Open document ID

1547.90188

0 references

Mathematics Subject Classification ID

0 references

0 references

10.1007/S10589-024-00565-9

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6541375