Sequence convergence of inexact nonconvex and nonsmooth algorithms with more realistic assumptions

DOI10.1080/01630563.2020.1871362MaRDI QIDQ4985183zbMATH OpenOpenAlexWikidataFDO

Authors Tao Sun

Publication date 22 April 2021

Published in Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01630563.2020.1871362

zbMATH Keywords

nonconvex minimizationconvergence analysisKurdyka-Lojasiewicz propertyinexact algorithms

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52) Numerical solutions to equations with nonlinear operators (65J15)

Recommendations

• An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization
• An abstract convergence framework with application to inertial inexact forward-backward methods
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features

Cites work

• Accelerated and inexact forward-backward algorithms
• An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
• Clarke Subgradients of Stratifiable Functions
• Convergence analysis of a proximal point algorithm for minimizing differences of functions
• Convergence of Proximal Iteratively Reweighted Nuclear Norm Algorithm for Image Processing
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
• Global convergence of proximal iteratively reweighted algorithm
• Global convergence of splitting methods for nonconvex composite optimization
• On gradients of functions definable in o-minimal structures
• On semi- and subanalytic geometry
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems

Cited in

(1)

• scientific article; zbMATH DE number 3905745 (Why is no real title available?)

This page was built for publication: Sequence convergence of inexact nonconvex and nonsmooth algorithms with more realistic assumptions

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