Short paper -- A note on the Frank-Wolfe algorithm for a class of nonconvex and nonsmooth optimization problems

DOI10.5802/ojmo.21zbMath1530.90083MaRDI QIDQ6114895

Welington de Oliveira

Publication date: 12 July 2023

Published in: OJMO. Open Journal of Mathematical Optimization (Search for Journal in Brave)

zbMATH Keywords

nonsmooth optimizationnonconvex optimizationFrank-Wolfe algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Methods of reduced gradient type (90C52)

Related Items (1)

The Frank-Wolfe algorithm: a short introduction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The ABC of DC programming
• A minimization method for the sum of a convex function and a continuously differentiable function
• Extension of the Frank-Wolfe algorithm to concave nondifferentiable objective functions
• Complexity bounds for primal-dual methods minimizing the model of objective function
• Randomized Smoothing for Stochastic Optimization
• Duality Between Subgradient and Conditional Gradient Methods
• Computing B-Stationary Points of Nonsmooth DC Programs
• Submonotone Subdifferentials of Lipschitz Functions
• Variational Analysis
• First-Order Methods in Optimization
• The sliding Frank–Wolfe algorithm and its application to super-resolution microscopy
• On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods
• The Alternating Descent Conditional Gradient Method for Sparse Inverse Problems

This page was built for publication: Short paper -- A note on the Frank-Wolfe algorithm for a class of nonconvex and nonsmooth optimization problems