Research map / Learning theory and algorithms / Combinatorial and search optimization
Faster Randomized Interior Point Methods for Tall/Wide Linear Programs
Agniva Chowdhury, Gregory Dexter, Palma London, Haim Avron, Petros Drineas
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Faster Randomized Infeasible Interior Point Methods for Tall/Wide Linear Programs (NeurIPS 2020 · similarity 0.98)
- On the Convergence of Inexact Predictor-Corrector Methods for Linear Programming (ICML 2022 · similarity 0.95)
- IPM-LSTM: A Learning-Based Interior Point Method for Solving Nonlinear Programs (NeurIPS 2024 · similarity 0.88)
- A Differentiable Interior-Point Method in Single Precision (NeurIPS 2026 · similarity 0.86)
- Provable Acceleration of Nesterov's Accelerated Gradient for Asymmetric Matrix Factorization and Linear Neural Networks (NeurIPS 2024 · similarity 0.85)
- Improving Convergence Guarantees of Random Subspace Second-order Algorithm for Nonconvex Optimization (ICLR 2025 · similarity 0.85)
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.
