arXiv (OAI)
open access
An Adaptive Proximal ADMM for Nonconvex Linearly Constrained Composite Programs
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
- McADMM: A Multi-Clique Augmented Lagrangian-Based Algorithm for Large-Scale Sparse SDPs with Bound Constraints#1156775
- Decentralized Nonconvex Optimization under Heavy-Tailed Noise: Normalization and Optimal Convergence#147084
- MDP modeling for multi-stage stochastic programs.#457717
- Accelerated Bregman Proximal Gradient Methods from Dual Geometric Perspectives#1129394
- SPADE-DFL: Communication-Efficient Decentralized Federated Learning via Derivative-Free Linearized ADMM#1108688
Record · ID 189200
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