Low-rank extragradient methods for scalable semidefinite optimization
From MaRDI portal
Cites work
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Array imaging using intensity-only measurements
- Complementarity and nondegeneracy in semidefinite programming
- Generalized conditional gradient with augmented Lagrangian for composite minimization
- Global rates of convergence for nonconvex optimization on manifolds
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Lagrangian methods for composite optimization
- On the convergence of projected-gradient methods with low-rank projections for smooth convex minimization over trace-norm balls and related problems
- On the simplicity and conditioning of low rank semidefinite programs
- Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
- Problems of distance geometry and convex properties of quadratic maps
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Random Laplacian matrices and convex relaxations
- Rank optimality for the Burer-Monteiro factorization
- Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates
- Scalable semidefinite programming
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Trust-region methods on Riemannian manifolds
- Why Are Big Data Matrices Approximately Low Rank?
This page was built for publication: Low-rank extragradient methods for scalable semidefinite optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988125)
