On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems
type: Item
instance of: scholarly article
title: On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems
zbMATH Open document ID: 1432.90118
author: Bo Wen
author: Xiaoping Xue
published in: Journal of Global Optimization
publication date: 2019-12-03T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C52
zbMATH DE Number: 7139381
zbMATH Keywords: convex minimization
zbMATH Keywords: proximal gradient algorithm
zbMATH Keywords: extrapolation
zbMATH Keywords: Łojasiewicz inequality
zbMATH Keywords: convergence
describes a project that uses: TFOCS
MaRDI profile type: Publication
full work available at URL: s10898-019-00789-8
OpenAlex ID: W2947334029
cites work: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
cites work: Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
cites work: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
cites work: Combining fast inertial dynamics for convex optimization with Tikhonov regularization
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Templates for convex cone problems with applications to sparse signal recovery
cites work: The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
cites work: Convex analysis and nonlinear optimization. Theory and examples.
cites work: An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
cites work: Exact matrix completion via convex optimization
cites work: Decoding by Linear Programming
cites work: On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm''
cites work: Compressed sensing
cites work: Adaptive restart for accelerated gradient schemes
cites work: A bundle Bregman proximal method for convex nondifferentiable minimization
cites work: Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
cites work: Splitting Algorithms for the Sum of Two Nonlinear Operators
cites work: Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods
cites work: Q5643297
cites work: On semi- and subanalytic geometry
cites work: Survey of Bundle Methods for Nonsmooth Optimization
cites work: Q3320132
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Smooth minimization of non-smooth functions
cites work: Dual extrapolation and its applications to solving variational inequalities and related problems
cites work: Q4235027
cites work: Variational Analysis
cites work: A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
cites work: A differential equation for modeling Nesterov's accelerated gradient method: theory and insights
cites work: Approximation accuracy, gradient methods, and error bound for structured convex optimization
Wikidata QID: Q127859474
DOI: 10.1007/S10898-019-00789-8
description: scientific article; zbMATH DE number 7139381