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) -
Design and Optimization of a Droop Controller to Fix the Frequency of a Microgrid System Using the Gray wolf Algorithm with Stability Analysis
by: Zhi Yuan, et al.
Published: (2023-09-01) -
Short Paper - The Binary Linearization Complexity of Pseudo-Boolean Functions
by: Walter, Matthias
Published: (2024-10-01) -
GREY WOLF OPTIMIZER BASED OPTIMAL PLACEMENT OF MULTIPLE FACTS DEVICES IN THE TRANSMISSION SYSTEM UNDER DYNAMIC LOADING SYSTEM
by: YUSUF SAMUEL SUNDAY, et al.
Published: (2021-06-01) -
Positivity of convolution quadratures generated by nonconvex sequences
by: Karaa, Samir
Published: (2024-11-01)