Short Paper - A note on the Frank–Wolfe algorithm for a class of nonconvex and nonsmooth optimization problems
Frank and Wolfe’s celebrated conditional gradient method is a well-known tool for solving smooth optimization problems for which minimizing a linear function over the feasible set is computationally cheap. However, when the objective function is nonsmooth, the method may fail to compute a stationary...
Saved in:
| Main Author: | de Oliveira, Welington |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Université de Montpellier
2023-01-01
|
| Series: | Open Journal of Mathematical Optimization |
| Subjects: | |
| Online Access: | https://ojmo.centre-mersenne.org/articles/10.5802/ojmo.21/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An interior proximal gradient method for nonconvex optimization
by: De Marchi, Alberto, et al.
Published: (2024-07-01) -
A Novel Nonconvex Penalty Method for a Rank Constrained Matrix Optimization Problem and its Applications
by: Zhang Wenjuan, et al.
Published: (2025-03-01) -
Regularized K-Means Clustering via Fully Corrective Frank-Wolfe Optimization
by: Ahmed Yacoub Yousif, et al.
Published: (2025-08-01) -
Some fixed point theorems for nonconvex spaces
by: F. Jafari, et al.
Published: (1998-01-01) -
Model boundary value problem for the Helmholtz equation in a nonconvex angle with periodic boundary data
by: A. Merzon, et al.
Published: (2025-02-01)