Image de couverture de livre

Inexact Moreau Envelope Lagrangian Method for Non-Convex Constrained Optimization under Local Error Bound Conditions on Constraint Functions

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Huang, Yankun, Lin, Qihang, Xu, Yangyang
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Enforcing Fair Predicted Scores on Intervals of Percentiles by Difference-of-Convex Constraints
par: He, Yutian, et autres
Publié: (2025)

Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints
par: Dahal, Hari, et autres
Publié: (2023)

Lower Complexity Bounds of First-order Methods for Affinely Constrained Composite Non-convex Problems
par: Liu, Wei, et autres
Publié: (2025)

An Adaptive Parameter-free and Projection-free Restarting Level Set Method for Constrained Convex Optimization Under the Error Bound Condition
par: Lin, Qihang, et autres
Publié: (2020)

A Near-optimal Method for Linearly Constrained Composite Non-convex Non-smooth Problems
par: Liu, Wei, et autres
Publié: (2025)

Two Innovations in Inexact Augmented Lagrangian Methods for Convex Optimization
par: Eckstein, Jonathan, et autres
Publié: (2025)

ripALM: A Relative-Type Inexact Proximal Augmented Lagrangian Method for Linearly Constrained Convex Optimization
par: Zhu, Jiayi, et autres
Publié: (2024)

Moreau Envelope Based Difference-of-weakly-Convex Reformulation and Algorithm for Bilevel Programs
par: Gao, Lucy L., et autres
Publié: (2023)

An Inexact Conditional Gradient Method for Constrained Bilevel Optimization
par: Abolfazli, Nazanin, et autres
Publié: (2023)

Beyond Convexity: Proximal-Perturbed Lagrangian Methods for Efficient Functional Constrained Optimization
par: Moon, Sang Bin, et autres
Publié: (2024)

Moreau Envelope for Nonconvex Bi-Level Optimization: A Single-loop and Hessian-free Solution Strategy
par: Liu, Risheng, et autres
Publié: (2024)

Tight Bounds for Online Convex Optimization with Adversarial Constraints
par: Sinha, Abhishek, et autres
Publié: (2024)

Penalty-Based First-Order Methods for Bilevel Optimization with Minimax and Constrained Lower-Level Problems
par: Shen, Yiyang, et autres
Publié: (2026)

Achieving Better Local Regret Bound for Online Non-Convex Bilevel Optimization
par: Jia, Tingkai, et autres
Publié: (2026)

Inexact and Implementable Accelerated Newton Proximal Extragradient Method for Convex Optimization
par: Huang, Ziyu, et autres
Publié: (2024)

Learning Constrained Optimization with Deep Augmented Lagrangian Methods
par: Kotary, James, et autres
Publié: (2024)

Distributed and Inexact Proximal Gradient Method for Online Convex Optimization
par: Bastianello, Nicola, et autres
Publié: (2020)

Deterministic and Stochastic Accelerated Gradient Method for Convex Semi-Infinite Optimization
par: Yao, Yao, et autres
Publié: (2023)

A Note on Complexity for Two Classes of Structured Non-Smooth Non-Convex Compositional Optimization
par: Yao, Yao, et autres
Publié: (2024)

Convergence Error Analysis of Reflected Gradient Langevin Dynamics for Globally Optimizing Non-Convex Constrained Problems
par: Sato, Kanji, et autres
Publié: (2022)

Methods with Local Steps and Random Reshuffling for Generally Smooth Non-Convex Federated Optimization
par: Demidovich, Yury, et autres
Publié: (2024)

Nonasymptotic Analysis of Accelerated Methods With Inexact Oracle Under Absolute Error Bound
par: Liu, Yin, et autres
Publié: (2024)

Optimal Bounds for Adversarial Constrained Online Convex Optimization
par: Ferreira, Ricardo N., et autres
Publié: (2025)

Linearly involved Generalized Moreau Enhanced Model with Non-quadratic Smooth Convex Data Fidelity Functions
par: Yata, Wataru, et autres
Publié: (2025)

An Inexact Proximal Framework for Nonsmooth Riemannian Difference-of-Convex Optimization
par: Jiang, Bo, et autres
Publié: (2025)

A New Inexact Gradient Descent Method with Applications to Nonsmooth Convex Optimization
par: Khanh, Pham Duy, et autres
Publié: (2023)

Differentially Private Non-Convex Optimization under the KL Condition with Optimal Rates
par: Menart, Michael, et autres
Publié: (2023)

Functionally Constrained Algorithm Solves Convex Simple Bilevel Problems
par: Zhang, Huaqing, et autres
Publié: (2024)

HUANet: Hard-Constrained Unrolled ADMM for Constrained Convex Optimization
par: Tran, Trinh, et autres
Publié: (2026)

From Inexact Gradients to Byzantine Robustness: Acceleration and Optimization under Similarity
par: Gaucher, Renaud, et autres
Publié: (2026)

Characterizations of Stability of Error Bounds for Convex Inequality Constraint Systems
par: Wei, Zhou, et autres
Publié: (2021)

New Lower Bounds for Stochastic Non-Convex Optimization through Divergence Decomposition
par: Saad, El Mehdi, et autres
Publié: (2025)

Smooth Quasar-Convex Optimization with Constraints
par: Martínez-Rubio, David
Publié: (2025)

Bregman Linearized Augmented Lagrangian Method for Nonconvex Constrained Stochastic Zeroth-order Optimization
par: Shi, Qiankun, et autres
Publié: (2025)

Moreau Envelope-Based Clustering for Generalized Multi-Source Weber Problem
par: Van, Nguyen Thi Thu
Publié: (2026)

Online Non-convex Optimization with Long-term Non-convex Constraints
par: Pan, Shijie, et autres
Publié: (2023)

On the Error-Propagation of Inexact Hotelling's Deflation for Principal Component Analysis
par: Liao, Fangshuo, et autres
Publié: (2023)

Non-Convex Federated Optimization under Cost-Aware Client Selection
par: Jiang, Xiaowen, et autres
Publié: (2025)

An Inexact Weighted Proximal Trust-Region Method
par: Maia, Leandro Farias, et autres
Publié: (2026)

Constrained Online Convex Optimization with Polyak Feasibility Steps
par: Hutchinson, Spencer, et autres
Publié: (2025)