arXiv (All)
open access
Weakly Quasar-Convex Optimization
This paper introduces the class of weakly quasar-convex functions, a notion that simultaneously generalizes weak convexity (and hence convexity) and quasar-convexity. We establish the theoretical foundation for this new class by developing its basic calculus, deriving characterizations, and systemat
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
- Duality in Optimization: A Visual Tutorial#1049486
- Optimal Transport for Continuous-Time Mean-Variance Portfolio Selection#1343909
- Distributed Algorithms for $α$-Potential Functions in General-Sum Games#1201529
- Exact oracle complexity for function-value suboptimality under weighted initial conditions#1118072
- The Minimum Q-Order of BFGS with Exact Line Search Is One#820025
Record · ID 1247854
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