Sharpness, Restart, and Acceleration (Q5210521)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7154041

Language	Label	Description	Also known as
English	Sharpness, Restart, and Acceleration	scientific article; zbMATH DE number 7154041

Statements

scholarly article

0 references

Sharpness, Restart, and Acceleration (English)

0 references

Alexandre d'Aspremont

0 references

0 references

SIAM Journal on Optimization

0 references

publication date

21 January 2020

0 references

full work available at URL

https://arxiv.org/abs/1702.03828

0 references

zbMATH Keywords

error bounds

0 references

sharpness

0 references

restart

0 references

accelerated methods

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality

0 references

Global Regularity Theorems

0 references

A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications

0 references

Smoothing and First Order Methods: A Unified Framework

0 references

Semianalytic and subanalytic sets

0 references

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

0 references

From error bounds to the complexity of first-order descent methods for convex functions

0 references

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

0 references

Weak Sharp Minima in Mathematical Programming

0 references

Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods

0 references

Restarting the accelerated coordinate descent method with a rough strong convexity estimate

0 references

Adaptive restart of accelerated gradient methods under local quadratic growth condition

0 references

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

0 references

New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure

0 references

First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games

0 references

0 references

On semi- and subanalytic geometry

0 references

Relatively Smooth Convex Optimization by First-Order Methods, and Applications

0 references

A Condition Number for Differentiable Convex Inequalities

0 references

Optimal methods of smooth convex minimization

0 references

0 references

Smooth minimization of non-smooth functions

0 references

Gradient methods for minimizing composite functions

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Universal gradient methods for convex optimization problems

0 references

Adaptive restart for accelerated gradient schemes

0 references

0 references

A simple nearly optimal restart scheme for speeding up first-order methods

0 references

An Application of Error Bounds for Convex Programming in a Linear Space

0 references

Computational complexity versus statistical performance on sparse recovery problems

0 references

Identifiers

zbMATH Open document ID

0 references

10.1137/18M1224568

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5210521

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5210521&oldid=36553546"