Cover Image

Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bertsimas, Dimitris, Cory-Wright, Ryan, Lo, Sean, Pauphilet, Jean
Format:	Preprint
Published:	2023
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A new perspective on low-rank optimization
by: Bertsimas, Dimitris, et al.
Published: (2021)

Compact Lifted Relaxations for Low-Rank Optimization
by: Cory-Wright, Ryan, et al.
Published: (2026)

Improved Approximation Algorithms for Orthogonally Constrained Problems Using Semidefinite Optimization
by: Cory-Wright, Ryan, et al.
Published: (2025)

Sparse PCA With Multiple Components
by: Cory-Wright, Ryan, et al.
Published: (2022)

A Stochastic Benders Decomposition Scheme for Large-Scale Stochastic Network Design
by: Bertsimas, Dimitris, et al.
Published: (2023)

Sparse Classification: a scalable discrete optimization perspective
by: Bertsimas, Dimitris, et al.
Published: (2017)

Global Optimization: A Machine Learning Approach
by: Bertsimas, Dimitris, et al.
Published: (2023)

Robust Regression over Averaged Uncertainty
by: Bertsimas, Dimitris, et al.
Published: (2023)

Catastrophe Insurance: An Adaptive Robust Optimization Approach
by: Bertsimas, Dimitris, et al.
Published: (2024)

From Data to Uncertainty Sets: a Machine Learning Approach
by: Bertsimas, Dimitris, et al.
Published: (2025)

Overfitting in Adaptive Robust Optimization
by: Zhu, Karl, et al.
Published: (2025)

Optimal Cross-Validation for Sparse Linear Regression
by: Cory-Wright, Ryan, et al.
Published: (2023)

A Machine Learning Approach to Two-Stage Adaptive Robust Optimization
by: Bertsimas, Dimitris, et al.
Published: (2023)

Stability Regularized Cross-Validation
by: Cory-Wright, Ryan, et al.
Published: (2025)

Low-Rank Extragradient Method for Nonsmooth and Low-Rank Matrix Optimization Problems
by: Garber, Dan, et al.
Published: (2022)

Low-Rank Mirror-Prox for Nonsmooth and Low-Rank Matrix Optimization Problems
by: Garber, Dan, et al.
Published: (2022)

Heaviside Low-Rank Support Matrix Machine
by: Xiu, Xianchao, et al.
Published: (2026)

Global Optimization via Optimal Decision Trees
by: Bertsimas, Dimitris, et al.
Published: (2022)

Towards Stable Machine Learning Model Retraining via Slowly Varying Sequences
by: Bertsimas, Dimitris, et al.
Published: (2024)

Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time
by: Gu, Yuzhou, et al.
Published: (2023)

From Sequential Nodes to GPU Batches: Parallel Branch and Bound for Optimal $k$-Sparse GLMs
by: Liu, Jiachang, et al.
Published: (2026)

Heuristic Optimal Transport in Branching Networks
by: Andrecut, M.
Published: (2023)

The Power of Preconditioning in Overparameterized Low-Rank Matrix Sensing
by: Xu, Xingyu, et al.
Published: (2023)

Can Learning Be Explained By Local Optimality In Robust Low-rank Matrix Recovery?
by: Ma, Jianhao, et al.
Published: (2023)

Simple Imputation Rules for Prediction with Missing Data: Contrasting Theoretical Guarantees with Empirical Performance
by: Bertsimas, Dimitris, et al.
Published: (2021)

Adaptive Optimization for Prediction with Missing Data
by: Bertsimas, Dimitris, et al.
Published: (2024)

Scalable First-order Method for Certifying Optimal k-Sparse GLMs
by: Liu, Jiachang, et al.
Published: (2025)

Non-linear Multi-objective Optimization with Probabilistic Branch and Bound
by: Huang, Hao, et al.
Published: (2025)

Certified Approximate Reachability (CARe): Formal Error Bounds on Deep Learning of Reachable Sets
by: Solanki, Prashant, et al.
Published: (2025)

DisjunctiveNet: Neural Symbolic Learning via Differentiable Convexified Optimization Layers
by: Pal, Shraman, et al.
Published: (2026)

Machine Learning Augmented Branch and Bound for Mixed Integer Linear Programming
by: Scavuzzo, Lara, et al.
Published: (2024)

One-Sided Matrix Completion from Ultra-Sparse Samples
by: Zhang, Hongyang R., et al.
Published: (2026)

Convergence of Gradient Descent with Small Initialization for Unregularized Matrix Completion
by: Ma, Jianhao, et al.
Published: (2024)

A Smoothing Newton Method for Rank-one Matrix Recovery
by: Maunu, Tyler, et al.
Published: (2025)

A New Branch-and-Bound Pruning Framework for $\ell_0$-Regularized Problems
by: Guyard, Theo, et al.
Published: (2024)

Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation
by: Cui, Chengyu, et al.
Published: (2026)

Matrix Completion with Graph Information: A Provable Nonconvex Optimization Approach
by: Wang, Yao, et al.
Published: (2025)

Robust Second-Order Nonconvex Optimization and Its Application to Low Rank Matrix Sensing
by: Li, Shuyao, et al.
Published: (2024)

GPU-friendly and Linearly Convergent First-order Methods for Certifying Optimal $k$-sparse GLMs
by: Liu, Jiachang, et al.
Published: (2026)

Should We Relax Stability in Matching Markets?
by: Bertsimas, Dimitris, et al.
Published: (2025)