arXiv (All)
open access
Accelerated primal--dual dynamics and algorithms for convex optimization with nonlinear inequality constraints
We consider convex optimization with nonlinear inequality constraints and develop a primal--dual multiplier framework that is consistent in continuous and discrete time. We first propose continuous-time dynamics with Nesterov-type vanishing damping $α/t$, together with suitable extrapolations of the
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
- Rank-Dependent Error Bounds and Near-Optimality in Quantum Control via Hierarchical Tucker Surrogates#1084619
- Primal-Dual Inexact Newton-MR for Nonconvex Optimization with Equality Constraints#996513
- Block-coordinate Plug-And-Play Methods with Armijo-like line-search for Image Restoration#974341
- Solving the Offline and Online Min-Max Problem of Non-smooth Submodular-Concave Functions: A Zeroth-Order Approach#974311
- SinkSLOT: Sinkhorn via Sparse Lifted Optimal Transport#792283
Record · ID 821350
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