Avoiding bad steps in Frank-Wolfe variants
From MaRDI portal
Publication:2111475
DOI10.1007/s10589-022-00434-3OpenAlexW3116575584MaRDI QIDQ2111475
Damiano Zeffiro, Francesco Rinaldi
Publication date: 16 January 2023
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.12737
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Estimates for the minimal width of polytopes inscribed in convex bodies
- An active-set algorithmic framework for non-convex optimization problems over the simplex
- The width and diameter of a simplex
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Evolution towards the maximum clique
- From error bounds to the complexity of first-order descent methods for convex functions
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Frank-Wolfe and friends: a journey into projection-free first-order optimization methods
- ``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern?
- Linearly convergent away-step conditional gradient for non-strongly convex functions
- A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
- Conditional Gradient Sliding for Convex Optimization
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- Projection-like Retractions on Matrix Manifolds
- An Extended Frank--Wolfe Method with “In-Face” Directions, and Its Application to Low-Rank Matrix Completion
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Clarke Subgradients of Stratifiable Functions
- Implementing Generating Set Search Methods for Linearly Constrained Minimization
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Some comments on Wolfe's ‘away step’
- On the Identification of Active Constraints
- Unimodular matrices of flow problems with additional constraints
- A Nonmonotone Line Search Technique for Newton’s Method
- Active Set Complexity of the Away-Step Frank--Wolfe Algorithm
- Polytope Conditioning and Linear Convergence of the Frank–Wolfe Algorithm
- Gradient Projection and Conditional Gradient Methods for Constrained Nonconvex Minimization
- First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants
- Stationarity Results for Generating Set Search for Linearly Constrained Optimization
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm
- Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem
This page was built for publication: Avoiding bad steps in Frank-Wolfe variants
