Cover Image

An interior proximal gradient method for nonconvex optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	De Marchi, Alberto, Themelis, Andreas
Format:	Preprint
Published:	2022
Subjects:	Optimization and Control 49J52, 65K05, 90C30
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A penalty barrier framework for nonconvex constrained optimization
by: De Marchi, Alberto, et al.
Published: (2024)

Local properties and augmented Lagrangians in fully nonconvex composite optimization
by: De Marchi, Alberto, et al.
Published: (2023)

A relaxed version of Ryu's three-operator splitting method for structured nonconvex optimization
by: Alcantara, Jan Harold, et al.
Published: (2025)

MGProx: A nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
by: Ang, Andersen, et al.
Published: (2023)

Shadow splitting methods for nonconvex optimisation: epi-approximation, convergence and saddle point avoidance
by: Atenas, Felipe
Published: (2025)

A new problem qualification based on approximate KKT conditions for Lipschitzian optimization with application to bilevel programming
by: Käming, Isabella, et al.
Published: (2024)

Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
by: Latafat, Puya, et al.
Published: (2019)

Understanding the Douglas-Rachford splitting method through the lenses of Moreau-type envelopes
by: Atenas, Felipe
Published: (2023)

On the convergence of proximal gradient methods for convex simple bilevel optimization
by: Latafat, Puya, et al.
Published: (2023)

Linesearch-free adaptive Bregman proximal gradient for convex minimization without relative smoothness
by: Ou, Hongjia, et al.
Published: (2025)

Riemannian Trust Region Methods for SC$^1$ Minimization
by: Zhang, Chenyu, et al.
Published: (2023)

First-order majorization-minimization meets high-order majorant: Boosted inexact high-order forward-backward method
by: Kabgani, Alireza, et al.
Published: (2025)

ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
by: Kabgani, Alireza, et al.
Published: (2024)

A truncated epsilon-subdifferential method for global DC optimization
by: Bagirov, Adil M., et al.
Published: (2025)

Gauss-Newton meets PANOC: A fast and globally convergent algorithm for nonlinear optimal control
by: Pas, Pieter, et al.
Published: (2022)

Complexity of trust-region methods with unbounded Hessian approximations for smooth and nonsmooth optimization
by: Leconte, Geoffroy, et al.
Published: (2023)

Augmented Lagrangian methods for fully convex composite optimization
by: De Marchi, Alberto, et al.
Published: (2025)

An interior-point trust-region method for nonsmooth regularized bound-constrained optimization
by: Leconte, Geoffroy, et al.
Published: (2024)

Nonmonotone subgradient methods based on a local descent lemma
by: Aragón-Artacho, Francisco J., et al.
Published: (2025)

Douglas-Rachford splitting and ADMM for nonconvex optimization: Accelerated and Newton-type linesearch algorithms
by: Themelis, Andreas, et al.
Published: (2020)

Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity
by: Latafat, Puya, et al.
Published: (2021)

Quasar-Convex Optimization: Fundamental Properties and High-Order Proximal-Point Methods
by: Ahookhosh, Masoud, et al.
Published: (2026)

A Projected Variable Smoothing for Weakly Convex Optimization and Supremum Functions
by: López-Rivera, Sergio, et al.
Published: (2025)

A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
by: Ahookhosh, Masoud, et al.
Published: (2019)

Distributed accelerated proximal conjugate gradient methods for multi-agent constrained optimization problems
by: Gebrie, Anteneh Getachew
Published: (2023)

Moreau envelope and proximal-point methods under the lens of high-order regularization
by: Kabgani, Alireza, et al.
Published: (2025)

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
by: Kabgani, Alireza, et al.
Published: (2025)

On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
by: Latafat, Puya, et al.
Published: (2023)

Ball-proximal point method on a Hadamard Manifolds
by: Babu, F., et al.
Published: (2026)

On the existence and the stability of solutions in nonconvex vector optimization
by: Van Nghi, Tran, et al.
Published: (2025)

Affordable mixed-integer Lagrangian methods: optimality conditions and convergence analysis
by: De Marchi, Alberto
Published: (2024)

Inexact Limited Memory Bundle Method
by: Lampainen, Jenni, et al.
Published: (2026)

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
by: Latafat, Puya, et al.
Published: (2023)

Using second-order information in gradient sampling methods for nonsmooth optimization
by: Gebken, Bennet
Published: (2022)

Adaptive proximal gradient methods are universal without approximation
by: Oikonomidis, Konstantinos A., et al.
Published: (2024)

On second-order optimality conditions for $C^{1,1}$ optimization problems via Lagrangian functions
by: An, Duong Thi Viet, et al.
Published: (2024)

SPIRAL: A superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization
by: Behmandpoor, Pourya, et al.
Published: (2022)

On second-order Karush--Kuhn--Tucker optimality conditions for $C^{1,1}$ vector optimization problems
by: Van Tuyen, Nguyen
Published: (2025)

On the growth of nonconvex functionals at strict local minimizers
by: Corella, Alberto Domínguez, et al.
Published: (2024)

Hybrid optimal control with mixed-integer Lagrangian methods
by: Nikitina, Viktoriya, et al.
Published: (2024)