arXiv (OAI Expanded)
open access
A proximal augmented Lagrangian method for nonconvex optimization with equality and inequality constraints
We propose an inexact proximal augmented Lagrangian method (P-ALM) for nonconvex structured optimization problems. The proposed method features an easily implementable rule not only for updating the penalty parameters, but also for adaptively tuning the proximal term. It allows the penalty parameter
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Proximal Nonlinear Conjugate Gradient Methods for Composite Optimization#677562
- Proximal Nonlinear Conjugate Gradient Methods for Composite Optimization#674363
- Halpern-Accelerated Majorized ADMM with Optimal Non-Ergodic Convergence under Degenerate Preconditioning#1143409
- Revisiting Proximal Bundle Methods: Improved Rates under H{ö}lder Smoothness#1109852
- Nonsmooth Convex Optimization using the Specular Gradient Method with Root-Linear Convergence#974178
Record · ID 1122944
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive