:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Zhuang, Yubo, Chen, Xiaohui, Yang, Yun, Zhang, Richard Y.
Format:	Preprint
Published:	2023
Subjects:	Machine Learning Optimization and Control
Online Access:	https://arxiv.org/abs/2305.18436
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Nonnegative Low-rank Matrix Recovery Can Have Spurious Local Minima
by: Zhang, Richard Y.
Published: (2025)

Scalable Second-order Riemannian Optimization for $K$-means Clustering
by: Xu, Peng, et al.
Published: (2025)

Accelerated Nonnegative Tensor Completion via Integer Programming
by: Pan, Wenhao, et al.
Published: (2022)

Sharp Global Guarantees for Nonconvex Low-rank Recovery in the Noisy Overparameterized Regime
by: Zhang, Richard Y.
Published: (2021)

Efficient Algorithms for Regularized Nonnegative Scale-invariant Low-rank Approximation Models
by: Cohen, Jeremy E., et al.
Published: (2024)

Well-conditioned Primal-Dual Interior-point Method for Accurate Low-rank Semidefinite Programming
by: Chiu, Hong-Ming, et al.
Published: (2024)

Low-Rank Extragradient Methods for Scalable Semidefinite Optimization
by: Garber, Dan, et al.
Published: (2024)

A Semidefinite Programming-Based Branch-and-Cut Algorithm for Biclustering
by: Sudoso, Antonio M.
Published: (2024)

Dual Conic Proxy for Semidefinite Relaxation of AC Optimal Power Flow
by: Qiu, Guancheng, et al.
Published: (2025)

Fast, Scalable, Warm-Start Semidefinite Programming with Spectral Bundling and Sketching
by: Angell, Rico, et al.
Published: (2023)

Mixtures Closest to a Given Measure: A Semidefinite Programming Approach
by: Đurašinović, Srećko, et al.
Published: (2025)

Towards Optimal Branching of Linear and Semidefinite Relaxations for Neural Network Robustness Certification
by: Anderson, Brendon G., et al.
Published: (2021)

Semidefinite Relaxations of the Gromov-Wasserstein Distance
by: Chen, Junyu, et al.
Published: (2023)

Modified K-means Algorithm with Local Optimality Guarantees
by: Li, Mingyi, et al.
Published: (2025)

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

Sum-of-norms regularized Nonnegative Matrix Factorization
by: Ang, Andersen, et al.
Published: (2024)

A Support-Set Algorithm for Optimization Problems with Nonnegative and Orthogonal Constraints
by: Wang, Lei, et al.
Published: (2025)

Neural Collapse versus Low-rank Bias: Is Deep Neural Collapse Really Optimal?
by: Súkeník, Peter, et al.
Published: (2024)

Efficient Low-rank Identification via Accelerated Iteratively Reweighted Nuclear Norm Minimization
by: Wang, Hao, et al.
Published: (2024)

Complexity of Chordal Conversion for Sparse Semidefinite Programs with Small Treewidth
by: Zhang, Richard Y.
Published: (2023)

Sparse Hyperparametric Itakura-Saito Nonnegative Matrix Factorization via Bi-Level Optimization
by: Selicato, Laura, et al.
Published: (2025)

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

Fast and Accurate Estimation of Low-Rank Matrices from Noisy Measurements via Preconditioned Non-Convex Gradient Descent
by: Zhang, Gavin, et al.
Published: (2023)

A Second-Order Majorant Algorithm for Nonnegative Matrix Factorization
by: Pham, Mai-Quyen, et al.
Published: (2023)

Majorization-minimization for Sparse Nonnegative Matrix Factorization with the $β$-divergence
by: Marmin, Arthur, et al.
Published: (2022)

Sobolev Gradient Ascent for Optimal Transport: Barycenter Optimization and Convergence Analysis
by: Kim, Kaheon, et al.
Published: (2025)

Preconditioned Gradient Descent for Overparameterized Nonconvex Burer--Monteiro Factorization with Global Optimality Certification
by: Zhang, Gavin, et al.
Published: (2022)

Improved Global Guarantees for the Nonconvex Burer--Monteiro Factorization via Rank Overparameterization
by: Zhang, Richard Y.
Published: (2022)

Weighted Low-rank Approximation via Stochastic Gradient Descent on Manifolds
by: Xu, Conglong, et al.
Published: (2025)

Statistical Inference of Constrained Stochastic Optimization via Sketched Sequential Quadratic Programming
by: Na, Sen, et al.
Published: (2022)

FedCluster: Boosting the Convergence of Federated Learning via Cluster-Cycling
by: Chen, Cheng, et al.
Published: (2020)

Provably Efficient Representation Selection in Low-rank Markov Decision Processes: From Online to Offline RL
by: Zhang, Weitong, et al.
Published: (2021)

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

A Mathematical Programming Approach to Optimal Classification Forests
by: Blanco, Víctor, et al.
Published: (2022)

In-depth Analysis of Low-rank Matrix Factorisation in a Federated Setting
by: Philippenko, Constantin, et al.
Published: (2024)

Nearly Optimal Linear Convergence of Stochastic Primal-Dual Methods for Linear Programming
by: Lu, Haihao, et al.
Published: (2021)

Comparative Analysis of Optimization Strategies for K-means Clustering in Big Data Contexts: A Review
by: Mussabayev, Ravil, et al.
Published: (2023)

Convergence Analysis of the Wasserstein Proximal Algorithm beyond Geodesic Convexity
by: Zhu, Shuailong, et al.
Published: (2025)

A conditional gradient homotopy method with applications to Semidefinite Programming
by: Dvurechensky, Pavel, et al.
Published: (2022)

Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery
by: Giampouras, Paris, et al.
Published: (2024)