Cover Image

Accelerating nuclear-norm regularized low-rank matrix optimization through Burer-Monteiro decomposition

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lee, Ching-pei, Liang, Ling, Tang, Tianyun, Toh, Kim-Chuan
Format:	Preprint
Published:	2022
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

Burer-Monteiro factorizability of nuclear norm regularized optimization
by: Ouyang, Wenqing, et al.
Published: (2025)

Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
by: Tang, Tianyun, et al.
Published: (2024)

Robust principal component analysis with rank and cardinality regularization under matrix factorization
by: Li, Wenjing, et al.
Published: (2026)

Accelerated projected gradient algorithms for sparsity constrained optimization problems
by: Alcantara, Jan Harold, et al.
Published: (2022)

A low-rank augmented Lagrangian method for doubly nonnegative relaxations of mixed-binary quadratic programs
by: Hou, Di, et al.
Published: (2025)

RiNNAL+: a Riemannian ALM Solver for SDP-RLT Relaxations of Mixed-Binary Quadratic Programs
by: Hou, Di, et al.
Published: (2025)

A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
by: Hou, Di, et al.
Published: (2025)

An Exact Penalty Approach for Equality Constrained Optimization over a Convex Set
by: Xiao, Nachuan, et al.
Published: (2025)

On the efficient computation of proximal operators of affine-constrained nonconvex functions
by: Hou, Di, et al.
Published: (2026)

A Quadratically Convergent Alternating Projection Method for Nonconvex Sets
by: Xiao, Nachuan, et al.
Published: (2025)

Tightness of SDP and Burer-Monteiro Factorization for Phase Synchronization in High-Noise Regime
by: Zhang, Anderson Ye
Published: (2025)

Optimization over convex polyhedra via Hadamard parametrizations
by: Tang, Tianyun, et al.
Published: (2024)

A preconditioned augmented Lagrangian method for solving semidefinite programming problems
by: Tang, Tianyun, et al.
Published: (2026)

Wasserstein distributionally robust optimization and its tractable regularization formulations
by: Chu, Hong T. M., et al.
Published: (2024)

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

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

Benign landscape for Burer-Monteiro factorizations of MaxCut-type semidefinite programs
by: Endor, Faniriana Rakoto, et al.
Published: (2024)

Revisiting Superlinear Convergence of Proximal Newton-Like Methods to Degenerate Solutions
by: Lee, Ching-pei, et al.
Published: (2026)

On the B-subdifferential of proximal operators of affine-constrained $\ell_1$ regularizer
by: Li, Xudong, et al.
Published: (2025)

A Bregman ADMM for Bethe variational problem
by: Khoo, Yuehaw, et al.
Published: (2025)

The robust isolated calmness of spectral norm regularized convex matrix optimization problems
by: Yin, Ziran, et al.
Published: (2024)

ripALM: A Relative-Type Inexact Proximal Augmented Lagrangian Method for Linearly Constrained Convex Optimization
by: Zhu, Jiayi, et al.
Published: (2024)

Convergence Analysis of a Relative-type Inexact Preconditioned Proximal ALM for Convex Nonlinear Programming
by: Yang, Lei, et al.
Published: (2025)

On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models
by: Li, Wenjing, et al.
Published: (2023)

Regularized Adaptive Momentum Dual Averaging with an Efficient Inexact Subproblem Solver for Training Structured Neural Network
by: Huang, Zih-Syuan, et al.
Published: (2024)

Adaptive sieving: A dimension reduction technique for sparse optimization problems
by: Yuan, Yancheng, et al.
Published: (2023)

Stochastic Bregman Subgradient Methods for Nonsmooth Nonconvex Optimization Problems
by: Ding, Kuangyu, et al.
Published: (2024)

Inexact Bregman Proximal Gradient Method and its Inertial Variant with Absolute and Partial Relative Stopping Criteria
by: Yang, Lei, et al.
Published: (2021)

A four-operator splitting algorithm for nonconvex and nonsmooth optimization
by: Alcantara, Jan Harold, et al.
Published: (2024)

Group zero-norm regularized robust loss minimization: proximal MM method and statistical error bound
by: Liang, Ling, et al.
Published: (2025)

Gauss-Southwell type descent methods for low-rank matrix optimization
by: Olikier, Guillaume, et al.
Published: (2023)

On the convergence rates of moment-SOS hierarchies approximation of truncated moment sequences
by: Tran, Hoang Anh, et al.
Published: (2025)

Global optimization of low-rank polynomials
by: Gaggioli, Llorenç Balada, et al.
Published: (2025)

On exploration of an interior mirror descent flow for stochastic nonconvex constrained problem
by: Ding, Kuangyu, et al.
Published: (2025)

An Inexact Bregman Proximal Difference-of-Convex Algorithm with Two Types of Relative Stopping Criteria
by: Yang, Lei, et al.
Published: (2024)

Tuning parameter selection for the adaptive nuclear norm regularized trace regression
by: Shang, Pan, et al.
Published: (2024)

Safe subspace screening for the adaptive nuclear norm regularized trace regression
by: Shang, Pan, et al.
Published: (2024)

On the strength of Burer's lifted convex relaxation to quadratic programming with ball constraints
by: Kılınç-Karzan, Fatma, et al.
Published: (2024)

Hyperspectral super-resolution via low rank tensor triple decomposition
by: Cui, Xiaofei, et al.
Published: (2023)

l1-norm regularized l1-norm best-fit lines
by: Ling, Xiao, et al.
Published: (2024)