arXiv (All)
open access
Descent--Ascent Structure of Uniform Nondegeneracy
Classical models such as smooth strongly convex minimization and strongly convex--strongly concave optimization combine two types of curvature information: curvature remains uniformly separated from zero, and its positive and negative orientations are prescribed in advance. Uniform nondegeneracy dis
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
- Understanding and inverse design of implicit bias in stochastic learning: a geometric perspective#1128542
- One Inverse Step is a Convex Program: Bayes-Limit Calibration of Diffusion Inversion#482152
- Difference-of-Convex Regularization for Graph Learning by Differentiable Programming#1201036
- A proximal gradient algorithm for composite log-concave sampling#1356043
- Applications of an Implementation Story for Non-sentential Models#98268
Record · ID 1202534
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