Research map / Learning theory and algorithms / Combinatorial and search optimization
On the Convergence of Inexact Predictor-Corrector Methods for Linear Programming
Gregory Dexter, Agniva Chowdhury, Haim Avron, Petros Drineas
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Error-adjustment vector v added to inexact predictor-corrector IPM (solver error O(ε)) | predictor-corrector IPM · Synthetic LPs | outer iteration count | No clear effect |
| Uncorrected inexact solver with residual guarantees (no error adjustment) | standard predictor-corrector IPM · theory | outer iteration complexity | No clear effect |
Closest papers by meaning
- IPM-LSTM: A Learning-Based Interior Point Method for Solving Nonlinear Programs (NeurIPS 2024 · similarity 0.89)
- A Differentiable Interior-Point Method in Single Precision (NeurIPS 2026 · similarity 0.85)
- Learning to Relax: Setting Solver Parameters Across a Sequence of Linear System Instances (ICLR 2024 · similarity 0.85)
- Differentiable Nonlinear Model Predictive Control (NeurIPS 2026 · similarity 0.84)
- Learning to Pivot as a Smart Expert (AAAI 2024 · similarity 0.84)
- ADMM for Nonconvex Optimization under Minimal Continuity Assumption (ICLR 2025 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
