Avoiding bad steps in Frank-Wolfe variants (Q2111475)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Avoiding bad steps in Frank-Wolfe variants	scientific article

Statements

scholarly article

0 references

Avoiding bad steps in Frank-Wolfe variants (English)

0 references

Damiano Zeffiro

0 references

Francesco Rinaldi

0 references

Computational Optimization and Applications

0 references

publication date

16 January 2023

0 references

full work available at URL

https://arxiv.org/abs/2012.12737

0 references

zbMATH Keywords

nonconvex optimization

0 references

first-order optimization

0 references

Frank-Wolfe variants

0 references

Kurdyka-Łojasiewicz property

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

An Extended Frank--Wolfe Method with “In-Face” Directions, and Its Application to Low-Rank Matrix Completion

0 references

A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm

0 references

0 references

Linearly convergent away-step conditional gradient for non-strongly convex functions

0 references

Conditional Gradient Sliding for Convex Optimization

0 references

Active Set Complexity of the Away-Step Frank--Wolfe Algorithm

0 references

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

0 references

Clarke Subgradients of Stratifiable Functions

0 references

Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity

0 references

Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods

0 references

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

0 references

Global convergence of ADMM in nonconvex nonsmooth optimization

0 references

A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion

0 references

Convergence of the Iterates of Descent Methods for Analytic Cost Functions

0 references

A Nonmonotone Line Search Technique for Newton’s Method

0 references

A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence

0 references

Stationarity Results for Generating Set Search for Linearly Constrained Optimization

0 references

Implementing Generating Set Search Methods for Linearly Constrained Minimization

0 references

Some comments on Wolfe's ‘away step’

0 references

Projection-like Retractions on Matrix Manifolds

0 references

Gradient Projection and Conditional Gradient Methods for Constrained Nonconvex Minimization

0 references

An active-set algorithmic framework for non-convex optimization problems over the simplex

0 references

``Active-set complexity'' of proximal gradient: how long does it take to find the sparsity pattern?

0 references

First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants

0 references

0 references

0 references

Error bounds and convergence analysis of feasible descent methods: A general approach

0 references

Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods

0 references

Polytope Conditioning and Linear Convergence of the Frank–Wolfe Algorithm

0 references

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

The width and diameter of a simplex

0 references

Estimates for the minimal width of polytopes inscribed in convex bodies

0 references

Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem

0 references

Unimodular matrices of flow problems with additional constraints

0 references

Frank-Wolfe and friends: a journey into projection-free first-order optimization methods

0 references

A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks

0 references

Evolution towards the maximum clique

0 references

0 references

0 references

On the Identification of Active Constraints

0 references

Identifiers

10.1007/s10589-022-00434-3

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2111475

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