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) -
An improved gray wolf optimization algorithm solving to functional optimization and engineering design problems
by: Yihui Qiu, et al.
Published: (2024-06-01) -
Dynamic Community in static social networks using the gray wolf optimizer algorithm
by: Fatemeh Besharatnia, et al.
Published: (2020-03-01) -
ABOUT CHARACTERISING MONOTONICITY OF NONSMOOTH CONTINUOUS MAPPINGS
by: Nguyễn Huy Chiêu, et al.
Published: (2012-06-01) -
Path Planning For A Mobile Robot Using The
Chessboard Method And Gray Wolf Optimization
Algorithm In Static And Dynamic Environments
by: Ali Hatami Zadeh, et al.
Published: (2024-09-01)