Inertial self-adaptive algorithms for solving non-smooth convex optimization problems

DOI10.1007/S11075-024-01788-XMaRDI QIDQ6660852zbMATH OpenFDO

Authors Xin Chen, Peichao Duan

Publication date 10 January 2025

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11075-024-01788-X

zbMATH Keywords

convex optimizationself-adaptive algorithmproximal gradient algorithminertial accelerationsplit proximal algorithm

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Convex programming (90C25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Set-valued and variational analysis (49J53) Numerical analysis (65-XX)

Recommendations

• New self-adaptive algorithms and inertial self-adaptive algorithms for the split variational inclusion problems in Hilbert space
• Two inertial proximal coordinate algorithms for a family of nonsmooth and nonconvex optimization problems
• An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
• A new inertial self-adaptive algorithm for split common fixed-point problems
• An inertial proximal splitting method with applications

Cites work

• scientific article; zbMATH DE number 3398324 (Why is no real title available?)
• scientific article; zbMATH DE number 3187170 (Why is no real title available?)
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• A general iterative method for nonexpansive mappings in Hilbert spaces
• A generic online acceleration scheme for optimization algorithms via relaxation and inertia
• Alternated and multi-step inertial approximation methods for solving convex bilevel optimization problems
• Iterative method with inertial for variational inequalities in Hilbert spaces
• Iterative oblique projection onto convex sets and the split feasibility problem
• New inertial proximal gradient methods for unconstrained convex optimization problems
• New proximal type algorithms for convex minimization and its application to image deblurring
• On the proximal gradient algorithm with alternated inertia
• Properties and iterative methods for the lasso and its variants
• Relaxed forward-backward splitting methods for solving variational inclusions and applications
• Self-adaptive algorithms for proximal split feasibility problems and strong convergence analysis
• Solving proximal split feasibility problems without prior knowledge of operator norms
• Solving the split feasibility problem without prior knowledge of matrix norms
• Solving the variational inequality problem defined on intersection of finite level sets
• Weak and strong convergence theorems for strict pseudo-contractions in Hilbert spaces

This page was built for publication: Inertial self-adaptive algorithms for solving non-smooth convex optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6660852)