Login / Signup
A low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach.
Renato D. C. Monteiro
Arnesh Sujanani
Diego Cifuentes
Published in:
CoRR (2024)
Keyphrases
</>
convex optimization
low rank
semidefinite programming
kernel matrix
primal dual
interior point methods
augmented lagrangian
total variation
convex relaxation
linear programming problems
image processing
maximum margin
machine learning
pairwise
denoising
high order