arXiv (All)
open access
Breaking the Odd Cycle: Regularization and First-Order Optimization for the Maximum $s$-Plex Problem
Building on a new regularized continuous formulation which avoids spurious solutions of the maximum $s$-plex problem, we develop a tailored block-coordinate first-order method that combines away-step Frank-Wolfe updates on the standard simplex with linear optimization over the fractional $b$-matchin
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
- Regularization and Variance-Weighted Regression Achieves Minimax Optimality in Linear MDPs: Theory and Practice#1199609
- Linearly Convergent Algorithms for Nonsmooth Problems with Unknown Smooth Regions#1344448
- Regularized coordinate minimization for nonconvex composite optimization with application to quantized image compression#973853
- Exact Verification of First-Order Methods via Mixed-Integer Linear Programming#1327208
- Obtaining Game-Stationary Points for Smooth Nonconvex-Nonconcave Minimax Problems via First-Order Methods#1117682
Record · ID 1234572
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