Cover Image

Complexity of Linearized Perturbed Augmented Lagrangian Methods for Nonsmooth Nonconvex Optimization with Nonlinear Equality Constraints

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bourkhissi, Lahcen El, Necoara, Ion, Patrinos, Panagiotis, Tran-Dinh, Quoc
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Complexity of linearized quadratic penalty for optimization with nonlinear equality constraints
by: Bourkhissi, Lahcen El, et al.
Published: (2024)

Convergence rates for an inexact linearized ADMM for nonsmooth nonconvex optimization with nonlinear equality constraints
by: Bourkhissi, Lahcen El, et al.
Published: (2025)

Convergence analysis of linearized $\ell_q$ penalty methods for nonconvex optimization with nonlinear equality constraints
by: Bourkhissi, Lahcen El, et al.
Published: (2025)

Developing Lagrangian-based Methods for Nonsmooth Nonconvex Optimization
by: Xiao, Nachuan, et al.
Published: (2024)

Shuffling Gradient-Based Methods for Nonconvex-Concave Minimax Optimization
by: Tran-Dinh, Quoc, et al.
Published: (2024)

QPALM: A Proximal Augmented Lagrangian Method for Nonconvex Quadratic Programs
by: Hermans, Ben, et al.
Published: (2020)

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

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

A stochastic perturbed augmented Lagrangian method for smooth convex constrained minimization
by: Singh, Nitesh Kumar, et al.
Published: (2025)

Quantum Hamiltonian Descent based Augmented Lagrangian Method for Constrained Nonconvex Nonlinear Optimization
by: Li, Mingze, et al.
Published: (2025)

Higher-order tensor methods for minimizing difference of convex functions
by: Necoara, Ion
Published: (2024)

Primal-Dual Methods for Nonsmooth Nonconvex Optimization with Orthogonality Constraints
by: Zhu, Linglingzhi, et al.
Published: (2026)

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

Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems
by: Nabou, Yassine, et al.
Published: (2025)

Adaptive Regularization within Trust Region Methods for Stochastic Nonconvex Optimization
by: Ha, Yunsoo, et al.
Published: (2026)

A Hybrid Subgradient Method for Nonsmooth Nonconvex Bilevel Optimization
by: Xiao, Nachuan, et al.
Published: (2025)

Stochastic Bregman Subgradient Methods for Nonsmooth Nonconvex Optimization Problems
by: Ding, Kuangyu, et al.
Published: (2024)

Coderivative-Based Newton Methods in Structured Nonconvex and Nonsmooth Optimization
by: Khanh, Pham Duy, et al.
Published: (2024)

NonOpt: Nonconvex, Nonsmooth Optimizer
by: Curtis, Frank E., et al.
Published: (2025)

Bregman Linearized Augmented Lagrangian Method for Nonconvex Constrained Stochastic Zeroth-order Optimization
by: Shi, Qiankun, et al.
Published: (2025)

Private Zeroth-Order Nonsmooth Nonconvex Optimization
by: Zhang, Qinzi, et al.
Published: (2024)

An Adaptive Proximal Point Method for Nonsmooth and Nonconvex Optimization on Hadamard Manifolds
by: Amaral, Vitaliano S., et al.
Published: (2025)

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

Deterministic Nonsmooth Nonconvex Optimization
by: Jordan, Michael I., et al.
Published: (2023)

On the Oracle Complexity of a Riemannian Inexact Augmented Lagrangian Method for Riemannian Nonsmooth Composite Problems
by: Xu, Meng, et al.
Published: (2024)

Regularized higher-order Taylor approximation methods for nonlinear least-squares
by: Nabou, Yassine, et al.
Published: (2025)

Random coordinate descent methods for nonseparable composite optimization
by: Chorobura, Flavia, et al.
Published: (2022)

Coordinate descent methods beyond smoothness and separability
by: Chorobura, Flavia, et al.
Published: (2024)

Random minibatch subgradient algorithms for convex problems with functional constraints
by: Nedich, Angelia, et al.
Published: (2019)

Convergence analysis of stochastic higher-order majorization-minimization algorithms
by: Lupu, Daniela, et al.
Published: (2021)

A systematic approach to general higher-order majorization-minimization algorithms for (non)convex optimization
by: Necoara, Ion, et al.
Published: (2020)

Moving higher-order Taylor approximations method for smooth constrained minimization problems
by: Nabou, Yassine, et al.
Published: (2024)

Exact representation and efficient approximations of linear model predictive control laws via HardTanh type deep neural networks
by: Lupu, Daniela, et al.
Published: (2024)

Zeroth-order Gradient and Quasi-Newton Methods for Nonsmooth Nonconvex Stochastic Optimization
by: Marrinan, Luke, et al.
Published: (2023)

Zeroth-Order Methods for Stochastic Nonconvex Nonsmooth Composite Optimization
by: Chen, Ziyi, et al.
Published: (2025)

Improved Sample Complexity for Private Nonsmooth Nonconvex Optimization
by: Kornowski, Guy, et al.
Published: (2024)

Lasry-Lions Envelopes and Nonconvex Optimization: A Homotopy Approach
by: Simões, Miguel, et al.
Published: (2021)

A Relaxation Method for Nonsmooth Nonlinear Optimization with Binary Constraints
by: Xiao, Lianghai, et al.
Published: (2026)

From Halpern's Fixed-Point Iterations to Nesterov's Accelerated Interpretations for Root-Finding Problems
by: Tran-Dinh, Quoc
Published: (2022)