An interior proximal gradient method for nonconvex optimization
We consider structured minimization problems subject to smooth inequality constraints and present a flexible algorithm that combines interior point (IP) and proximal gradient schemes. While traditional IP methods cannot cope with nonsmooth objective functions and proximal algorithms cannot handle co...
Saved in:
Main Authors: | De Marchi, Alberto, Themelis, Andreas |
---|---|
Format: | Article |
Language: | English |
Published: |
Université de Montpellier
2024-07-01
|
Series: | Open Journal of Mathematical Optimization |
Subjects: | |
Online Access: | https://ojmo.centre-mersenne.org/articles/10.5802/ojmo.30/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Short Paper - A note on the Frank–Wolfe algorithm for a class of nonconvex and nonsmooth optimization problems
by: de Oliveira, Welington
Published: (2023-01-01) -
Smoothing gradient descent algorithm for the composite sparse optimization
by: Wei Yang, et al.
Published: (2024-11-01) -
A NEW PROOF OF CLARKE'S THEOREM
by: Gue Myung Lee, et al.
Published: (2012-09-01) -
On the relationship of interior-point methods
by: Ruey-Lin Sheu, et al.
Published: (1993-01-01) -
LNC points for m-convex sets
by: Marilyn Breen
Published: (1981-01-01)