arXiv (All)
open access
A Two-Dimensional Extremizer for Relatively Inexact Gradient Descent
We give an explicit extremal function for one step of gradient descent when the gradient error is bounded relative to the true gradient. The function is the sum of a quadratic in one coordinate and a Huber function in the other. It attains, for every admissible relative error level and every stepsiz
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
- Doubly exponential convergence of the cyclic steepest descent method for strictly convex quadratics in arbitrary dimensions#1061430
- Extremal domains in S2: Geometric and analytic methods#416252
- A proximal augmented Lagrangian method for nonconvex optimization with equality and inequality constraints#1122944
- An accelerated proximal PRS-SQP algorithm with dual ascent-descent procedures for smooth composite optimization#1131393
- Revisiting Proximal Bundle Methods: Improved Rates under H{ö}lder Smoothness#1109852
Record · ID 1154779
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