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) -
Bolza type problems in infinite dimensional discrete time
by: Rahma Sahraoui
Published: (2013-06-01) -
The proximal point algorithm with a general perturbation on geodesic spaces
by: Takuto Kajimura, et al.
Published: (2025-08-01) -
Critical points of locally Lipschitz functionals inside and outside the ordered interval
by: Xi'an Xu, et al.
Published: (2025-02-01) -
Best proximity point theorems for interpolative Kannan-type and Ćirić–Reich–Rus-type L $\mathcal{L} $ -proximal contractions
by: Müzeyyen Sangurlu Sezen, et al.
Published: (2025-06-01)