Imagen de Portada

Q-Linear Convergence of the Proximal Augmented Lagrangian Method for Non-Convex Conic Programming

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Zhang, Ning, Zhang, Yi
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control 9C30
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Extending Linear Convergence of the Proximal Point Algorithm: The Quasar-Convex Case
por: de Brito, José, et al.
Publicado: (2025)

Inexact Augmented Lagrangian Methods for Conic Programs: Quadratic Growth and Linear Convergence
por: Liao, Feng-Yi, et al.
Publicado: (2024)

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

Scaled Proximal Gradient Methods for Multiobjective Optimization: Improved Linear Convergence and Nesterov's Acceleration
por: Chen, Jian, et al.
Publicado: (2024)

Star Quasiconvexity: a Unified Approach for Linear Convergence of First-Order Methods Beyond Convexity
por: Khanh, Phan Quoc, et al.
Publicado: (2025)

The Augmented Lagrangian Methods: Overview and Recent Advances
por: Deng, Kangkang, et al.
Publicado: (2025)

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
por: Zhang, Liwei, et al.
Publicado: (2025)

Splitting Proximal Point Algorithms for the Sum of Prox-Convex Functions
por: de Brito, Jose, et al.
Publicado: (2026)

An Augmented Lagrangian Method for Training Recurrent Neural Networks
por: Wang, Yue, et al.
Publicado: (2024)

Convergence Rate of Projected Subgradient Method with Time-varying Step-sizes
por: Zhu, Zhihan, et al.
Publicado: (2024)

Convergence, Duality and Well-Posedness in Convex Bilevel Optimization
por: Giang-Tran, Khanh-Hung, et al.
Publicado: (2025)

Variational Poisson Denoising via Augmented Lagrangian Methods
por: Kanzow, Christian, et al.
Publicado: (2023)

A Boosted-DCA with Power-Sum-DC Decomposition for Linearly Constrained Polynomial Programs
por: Zhang, Hu, et al.
Publicado: (2022)

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

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

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

A Stochastic Implicit Proximal Point Algorithm for Solving Linearly Constrained Stochastic Minimax Problems
por: Zhu, Kehan, et al.
Publicado: (2026)

On Convergence of Regularized Barzilai-Borwein Method
por: Xu, Xin
Publicado: (2025)

Optimal Subgradient Methods for Lipschitz Convex Optimization with Error Bounds
por: Wang, Alex L.
Publicado: (2025)

Augmented Lagrangian Functions for Cone Constrained Optimization: the Existence of Global Saddle Points and Exact Penalty Property
por: Dolgopolik, M. V.
Publicado: (2017)

A Globally Convergent Gradient Method with Momentum
por: Lapucci, Matteo, et al.
Publicado: (2024)

Learning Hybrid Dynamics via Convex Optimizations
por: Iwasaki, Kaito, et al.
Publicado: (2025)

Global Solutions to Non-Convex Functional Constrained Problems with Hidden Convexity
por: Fatkhullin, Ilyas, et al.
Publicado: (2025)

A Projection-Free Method for Solving Convex Bilevel Optimization Problems
por: Giang-Tran, Khanh-Hung, et al.
Publicado: (2023)

cuHALLaR: A GPU Accelerated Low-Rank Augmented Lagrangian Method for Large-Scale Semidefinite Programming
por: Aguirre, Jacob M., et al.
Publicado: (2025)

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

GFORS: GPU-Accelerated First-Order Method with Randomized Sampling for Binary Integer Programs
por: Wei, Ningji, et al.
Publicado: (2025)

Switching Network System Identification via Convex Optimizations
por: Iwasaki, Kaito, et al.
Publicado: (2025)

Preconditioned Proximal Gradient Methods with Conjugate Momentum: A Subspace Perspective
por: Chen, Jian, et al.
Publicado: (2026)

Optimality conditions for problems over symmetric cones and a simple augmented Lagrangian method
por: Lourenço, Bruno F., et al.
Publicado: (2017)

Revisiting the Geometrically Decaying Step Size: Linear Convergence for Smooth or Non-Smooth Functions
por: Kim, Jihun
Publicado: (2025)

Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints
por: Lin, Zhenwei, et al.
Publicado: (2022)

Proximal Nonlinear Conjugate Gradient Methods for Composite Optimization
por: Hamana, Shodai, et al.
Publicado: (2026)

Lipschitz-free Projected Subgradient Method with Time-varying Step-size
por: Xia, Yong, et al.
Publicado: (2024)

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

Proximal methods for structured nonsmooth optimization over Riemannian submanifolds
por: Li, Qia, et al.
Publicado: (2024)

A Proximal Stochastic Gradient Method with Adaptive Step Size and Variance Reduction for Convex Composite Optimization
por: Fang, Changjie, et al.
Publicado: (2025)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
por: Xie, Xiyuan, et al.
Publicado: (2025)

On Tackling High-Dimensional Nonconvex Stochastic Optimization via Stochastic First-Order Methods with Non-smooth Proximal Terms and Variance Reduction
por: Xie, Yue, et al.
Publicado: (2025)