Cover Image

Beyond Convexity: Proximal-Perturbed Lagrangian Methods for Efficient Functional Constrained Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Moon, Sang Bin, Kim, Jong Gwang, Chandra, Ashish, Brinton, Christopher, Hashemi, Abolfazl
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimization via First-Order Switching Methods: Skew-Symmetric Dynamics and Optimistic Discretization
by: Upadhyay, Antesh, et al.
Published: (2025)

FedSGM: A Unified Framework for Constraint Aware, Bidirectionally Compressed, Multi-Step Federated Optimization
by: Upadhyay, Antesh, et al.
Published: (2026)

ripALM: A Relative-Type Inexact Proximal Augmented Lagrangian Method for Linearly Constrained Convex Optimization
by: Zhu, Jiayi, et al.
Published: (2024)

Lower Bounds and Proximally Anchored SGD for Non-Convex Minimization Under Unbounded Variance
by: Fazla, Arda, et al.
Published: (2026)

Smoothed Proximal Lagrangian Method for Nonlinear Constrained Programs
by: Pu, Wenqiang, et al.
Published: (2024)

Beyond Bounded Variance: Variance-Reduced Normalized Methods for Nonconvex Optimization under Blum-Gladyshev Noise
by: Upadhyay, Antesh, et al.
Published: (2026)

Hinge-Proximal Stochastic Gradient Methods for Convex Optimization with Functional Constraints
by: Rajoriya, Vaibhav, et al.
Published: (2025)

Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints
by: Dahal, Hari, et al.
Published: (2023)

A Primal-Dual Gradient Descent Approach to the Connectivity Constrained Sensor Coverage Problem
by: Agerman, Mathias Bock, et al.
Published: (2025)

A Proximal Augmented Lagrangian Method Based on Quadratic Approximations for Weakly Convex Optimization
by: Zhang, Yule, et al.
Published: (2026)

A Proximal Descent Method for Minimizing Weakly Convex Optimization
by: Liao, Feng-Yi, et al.
Published: (2025)

A Proximal Method for Composite Optimization with Smooth and Convex Components
by: Uzun, Samet, et al.
Published: (2025)

Distributed and Inexact Proximal Gradient Method for Online Convex Optimization
by: Bastianello, Nicola, et al.
Published: (2020)

Two Innovations in Inexact Augmented Lagrangian Methods for Convex Optimization
by: Eckstein, Jonathan, et al.
Published: (2025)

Proximal Projection Method for Stable Linearly Constrained Optimization
by: Heaton, Howard
Published: (2024)

An Augmented Lagrangian Value Function Method for Lower-level Constrained Stochastic Bilevel Optimization
by: Nie, Hantao, et al.
Published: (2025)

Inexact and Implementable Accelerated Newton Proximal Extragradient Method for Convex Optimization
by: Huang, Ziyu, et al.
Published: (2024)

Inexact Moreau Envelope Lagrangian Method for Non-Convex Constrained Optimization under Local Error Bound Conditions on Constraint Functions
by: Huang, Yankun, et al.
Published: (2025)

Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms
by: Huang, Minhui, et al.
Published: (2021)

Optimal Acceleration for Proximal Minimization of the Sum of Convex and Strongly Convex Functions
by: Chari, Govind M., et al.
Published: (2026)

Q-Linear Convergence of the Proximal Augmented Lagrangian Method for Non-Convex Conic Programming
by: Zhang, Ning, et al.
Published: (2025)

A Zeroth-order Proximal Stochastic Gradient Method for Weakly Convex Stochastic Optimization
by: Pougkakiotis, Spyridon, et al.
Published: (2022)

Adaptive Proximal Gradient Method for Convex Optimization
by: Malitsky, Yura, et al.
Published: (2023)

Solving Convex Smooth Function Constrained Optimization Is Almost As Easy As Unconstrained Optimization
by: Zhang, Zhe, et al.
Published: (2022)

Weak Proximal Newton Oracles for Composite Convex Optimization
by: Garber, Dan
Published: (2025)

Robust Learning Meets Quasar-Convex Optimization: Inexact High-Order Proximal-Point Methods
by: Kabgani, Alireza, et al.
Published: (2026)

Learning Constrained Optimization with Deep Augmented Lagrangian Methods
by: Kotary, James, et al.
Published: (2024)

Perturbed Proximal Gradient ADMM for Nonconvex Composite Optimization
by: Zhou, Yuan, et al.
Published: (2025)

Constrained Bi-Level Optimization: Proximal Lagrangian Value function Approach and Hessian-free Algorithm
by: Yao, Wei, et al.
Published: (2024)

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

Complexity of Linearized Perturbed Augmented Lagrangian Methods for Nonsmooth Nonconvex Optimization with Nonlinear Equality Constraints
by: Bourkhissi, Lahcen El, et al.
Published: (2025)

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

An Inexact Proximal Framework for Nonsmooth Riemannian Difference-of-Convex Optimization
by: Jiang, Bo, et al.
Published: (2025)

Global Convergence of Control-Based Lagrangian Flows for Non-Convex Optimization
by: Pirrera, Simone, et al.
Published: (2026)

Perturbation Analysis of Error Bounds for Convex Functions on Banach Spaces
by: Wei, Zhou, et al.
Published: (2024)

An Exact Penalty Approach for Equality Constrained Optimization over a Convex Set
by: Xiao, Nachuan, et al.
Published: (2025)

Stochastic Approximation Proximal Subgradient Method for Stochastic Convex-Concave Minimax Optimization
by: Dai, Yu-Hong, et al.
Published: (2024)

Model Construction for Convex-Constrained Derivative-Free Optimization
by: Roberts, Lindon
Published: (2024)

A Finite-Iteration Theory for Asynchronous Categorical Distributional Temporal-Difference Learning
by: Kaya, Ege C., et al.
Published: (2026)

Interwoven SDP in Primal-Dual Proximal Splitting Methods for Adjustable Robust Convex Optimisation with SOS-Convex Polynomial Constraints
by: Dizon, Neil D., et al.
Published: (2026)