Cover Image

A new perspective on low-rank optimization

Fuente: arXiv

Saved in:

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

Similar Items

Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion
by: Bertsimas, Dimitris, et al.
Published: (2023)

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)

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

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

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)

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)

Robust Regression over Averaged Uncertainty
by: Bertsimas, Dimitris, 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)

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

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

Accelerating nuclear-norm regularized low-rank matrix optimization through Burer-Monteiro decomposition
by: Lee, Ching-pei, et al.
Published: (2022)

A novel exact approach to polynomial optimization
by: Bertsimas, Dimitris, et al.
Published: (2025)

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)

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

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

Robust and Adaptive Optimization under a Large Language Model Lens
by: Bertsimas, Dimitris, et al.
Published: (2024)

The power of small initialization in noisy low-tubal-rank tensor recovery
by: Liu, ZHiyu, et al.
Published: (2026)

Sampling from Boltzmann densities with physics informed low-rank formats
by: Hagemann, Paul, et al.
Published: (2024)

The Mixing method: low-rank coordinate descent for semidefinite programming with diagonal constraints
by: Wang, Po-Wei, et al.
Published: (2017)

An optimal control perspective on diffusion-based generative modeling
by: Berner, Julius, et al.
Published: (2022)

Accelerating optimization over the space of probability measures
by: Chen, Shi, et al.
Published: (2023)

Adaptive Sharpness-Aware Minimization with a Polyak-type Step size: A Theory-Grounded Scheduler
by: Oikonomou, Dimitris, et al.
Published: (2026)

Safeguarded Stochastic Polyak Step Sizes for Non-smooth Optimization: Robust Performance Without Small (Sub)Gradients
by: Oikonomou, Dimitris, et al.
Published: (2025)

Stochastic Polyak Step-sizes and Momentum: Convergence Guarantees and Practical Performance
by: Oikonomou, Dimitris, et al.
Published: (2024)

Sharpness-Aware Minimization: General Analysis and Improved Rates
by: Oikonomou, Dimitris, et al.
Published: (2025)

A space-decoupling framework for optimization on bounded-rank matrices with orthogonally invariant constraints
by: Yang, Yan, et al.
Published: (2025)

Stability properties of gradient flow dynamics for the symmetric low-rank matrix factorization problem
by: Mohammadi, Hesameddin, et al.
Published: (2024)

Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes
by: Lan, Guanghui, et al.
Published: (2024)

A randomized algorithm for nonconvex minimization with inexact evaluations and complexity guarantees
by: Li, Shuyao, et al.
Published: (2023)

A theoretical and empirical study of new adaptive algorithms with additional momentum steps and shifted updates for stochastic non-convex optimization
by: Alecsa, Cristian Daniel
Published: (2021)

Learning to optimize: A tutorial for continuous and mixed-integer optimization
by: Chen, Xiaohan, et al.
Published: (2024)

Efficient Duple Perturbation Robustness in Low-rank MDPs
by: Hu, Yang, et al.
Published: (2024)

Absence of spurious solutions far from ground truth: A low-rank analysis with high-order losses
by: Ma, Ziye, et al.
Published: (2024)

A simple uniformly optimal method without line search for convex optimization
by: Li, Tianjiao, et al.
Published: (2023)