arXiv (All)
open access
Adaptive First-Order Methods with Composite Gradient Error
We study first-order optimization with inexact gradients whose errors combine a component proportional to the true gradient norm and a uniformly bounded absolute component. We develop an adaptive gradient descent scheme that selects estimates of the smoothness constant and both error parameters thro
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
- Can Acceleration in Gradient-Norm Minimization Be Anytime? Sharp Last-Iterate Limits in Smooth Convex Optimization#972760
- An Adaptive Augmented Lagrangian Method for Deterministic and Stochastic Nonconvex Optimization#780975
- An Adaptive Augmented Lagrangian Method for Deterministic and Stochastic Nonconvex Optimization#779600
- Proximal Nonlinear Conjugate Gradient Methods for Composite Optimization#677562
- Proximal Nonlinear Conjugate Gradient Methods for Composite Optimization#674363
Record · ID 1389809
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