Cover Image

The inexact power augmented Lagrangian method for constrained nonconvex optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bodard, Alexander, Oikonomidis, Konstantinos, Laude, Emanuel, Patrinos, Panagiotis
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Global Convergence Analysis of the Power Proximal Point and Augmented Lagrangian Method
by: Oikonomidis, Konstantinos A., et al.
Published: (2023)

On the Regularity of Generalized Conjugate Functions
by: Oikonomidis, Konstantinos, et al.
Published: (2026)

Forward-backward splitting under the light of generalized convexity
by: Oikonomidis, Konstantinos, et al.
Published: (2025)

Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization
by: Bodard, Alexander, et al.
Published: (2025)

Nonlinearly Preconditioned Gradient Methods under Generalized Smoothness
by: Oikonomidis, Konstantinos, et al.
Published: (2025)

Scaled relative graphs for pairs of operators beyond classical monotonicity
by: Quan, Jan, et al.
Published: (2025)

Nonlinearly preconditioned gradient flows
by: Oikonomidis, Konstantinos, et al.
Published: (2025)

Escaping saddle points without Lipschitz smoothness: the power of nonlinear preconditioning
by: Bodard, Alexander, et al.
Published: (2025)

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

Newton methods beyond Hessian Lipschitz continuity: A nonlinear preconditioning approach
by: Bodard, Alexander, et al.
Published: (2026)

Anisotropic Proximal Point Algorithm
by: Laude, Emanuel, et al.
Published: (2023)

Anisotropic Proximal Gradient
by: Laude, Emanuel, et al.
Published: (2022)

Constrained Stochastic Spectral Preconditioning Converges for Nonconvex Objectives
by: Oikonomidis, Konstantinos, et al.
Published: (2026)

Dualities for non-Euclidean smoothness and strong convexity under the light of generalized conjugacy
by: Laude, Emanuel, et al.
Published: (2021)

Nonlinearly Preconditioned Gradient Methods: Momentum and Stochastic Analysis
by: Oikonomidis, Konstantinos, et al.
Published: (2025)

A randomized algorithm for nonconvex minimization with inexact evaluations and complexity guarantees
by: Li, Shuyao, et al.
Published: (2023)

Block majorization-minimization with diminishing radius for constrained nonsmooth nonconvex optimization
by: Lyu, Hanbaek, et al.
Published: (2020)

EM++: A parameter learning framework for stochastic switching systems
by: Wang, Renzi, et al.
Published: (2024)

All roads lead to Rome: Path-following Augmented Lagrangian Methods via Bregman Proximal Regularization
by: Laude, Emanuel
Published: (2026)

An adaptively inexact first-order method for bilevel optimization with application to hyperparameter learning
by: Salehi, Mohammad Sadegh, et al.
Published: (2023)

An augmented Lagrangian trust-region method with inexact gradient evaluations to accelerate constrained optimization problems using model hyperreduction
by: Wen, Tianshu, et al.
Published: (2024)

An inexact Bregman proximal point method and its acceleration version for unbalanced optimal transport
by: Chen, Xiang, et al.
Published: (2024)

Rethinking PCA Through Duality
by: Quan, Jan, et al.
Published: (2025)

Newton-CG methods for nonconvex unconstrained optimization with Hölder continuous Hessian
by: He, Chuan, et al.
Published: (2023)

Parametric Nonconvex Optimization via Convex Surrogates
by: Wang, Renzi, et al.
Published: (2026)

A distributed semismooth Newton based augmented Lagrangian method for distributed optimization
by: Ma, Qihao, et al.
Published: (2026)

An inexact $q$-order regularized proximal Newton method for nonconvex composite optimization
by: Liu, Ruyu, et al.
Published: (2023)

On exploration of an interior mirror descent flow for stochastic nonconvex constrained problem
by: Ding, Kuangyu, et al.
Published: (2025)

General framework for online-to-nonconvex conversion: Schedule-free SGD is also effective for nonconvex optimization
by: Ahn, Kwangjun, et al.
Published: (2024)

An inexact LPA for DC composite optimization and application to matrix completions with outliers
by: Tao, Ting, et al.
Published: (2023)

A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization
by: Liu, Wei, et al.
Published: (2025)

Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes
by: Lan, Guanghui, et al.
Published: (2024)

A proximal augmented Lagrangian method for nonconvex optimization with equality and inequality constraints
by: Adeoye, Adeyemi D., et al.
Published: (2025)

Adam with model exponential moving average is effective for nonconvex optimization
by: Ahn, Kwangjun, et al.
Published: (2024)

Adaptive directional decomposition methods for nonconvex constrained optimization
by: Shi, Qiankun, et al.
Published: (2025)

Imitation Learning from Observations: An Autoregressive Mixture of Experts Approach
by: Wang, Renzi, et al.
Published: (2024)

Exact worst-case convergence rates of gradient descent: a complete analysis for all constant stepsizes over nonconvex and convex functions
by: Rotaru, Teodor, et al.
Published: (2024)

Complexity of a linearized augmented Lagrangian method for nonconvex minimization with nonlinear equality constraints
by: Bourkhissi, Lahcen El, et al.
Published: (2023)

A distributed augmented Lagrangian decomposition algorithm for constrained optimization
by: Guo, Wenyou, et al.
Published: (2025)

Stability of Primal-Dual Gradient Flow Dynamics for Multi-Block Convex Optimization Problems
by: Ozaslan, Ibrahim K., et al.
Published: (2024)