arXiv (All)
open access
Nonmonotone subgradient methods based on a local descent lemma
In this paper we present a nonmonotone line search subgradient algorithm tailored to upper-$\mathcal{C}^2$ functions. This is a family of nonsmooth and nonconvex functions that satisfies a nonsmooth and local version of the descent lemma, making them suitable for line searches. We prove subsequentia
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
- The Tamed Subgradient Unadjusted Langevin Algorithm beyond Convexity#432518
- Preconditioned Three-Term Conjugate Gradient Framework for Nonconvex Finite Minimax Problems#1083257
- A preconditioning proximal Newton method for nondifferentiable convex optimization#429983
- TIGER: Inverting Transformer Gradients via Embedding-Subspace Distance Optimization#287080
- Sampled-Max Subgradient Method for Convex Finite-Max Optimization#1117585
Record · ID 1141448
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