arXiv (All)
open access
Exact Verification of First-Order Methods via Mixed-Integer Linear Programming
We present exact mixed-integer linear programming formulations for verifying the performance of first-order methods for parametric quadratic optimization. We formulate the verification problem as a mixed-integer linear program where the objective is to maximize the infinity norm of the fixed-point r
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
- A Tardos-Type Algorithm for Separable Convex Quadratic Programming#1216840
- TinySDP: Real Time Semidefinite Optimization for Certifiable and Agile Edge Robotics#1123088
- Breaking the Odd Cycle: Regularization and First-Order Optimization for the Maximum $s$-Plex Problem#1234572
- A proximal augmented Lagrangian method for nonconvex optimization with equality and inequality constraints#1122944
- Accelerated Safe Gradient Flow#1186747
Record · ID 1327208
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