arXiv (OAI Expanded)
open access
Basic Inequalities for First-Order Optimization with Applications to Statistical Risk Analysis
In this work, we introduce $\textit{basic inequalities}$ for first-order iterative optimization algorithms, forming a simple yet versatile framework which connects implicit and explicit regularization. Building on related comparison inequalities for optimization iterates that already exist in the li
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
- Barzilai–Borwein-like rules in proximal gradient schemes for ℓ1-regularized problems#814159
- Higher-Order Sensitivity Analysis of Wasserstein and Adapted Wasserstein Distributionally Robust Optimization Problems#1051838
- Matching Higher-Order Oracle Complexity for Smooth Monotone Variational Inequalities#1071248
- Greedy algorithms for cone constrained optimization with convergence guarantees#304768
- Strong Duality in Risk-Constrained Nonconvex Functional Programming#1014439
Record · ID 1084105
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