Scalable Semidefinite Programming (Q4999352)

scientific article; zbMATH DE number 7368784

Language	Label	Description	Also known as
English	Scalable Semidefinite Programming	scientific article; zbMATH DE number 7368784

Statements

instance of

scholarly article

0 references

title

Scalable Semidefinite Programming (English)

0 references

0 references

0 references

0 references

0 references

0 references

SIAM Journal on Mathematics of Data Science

0 references

publication date

6 July 2021

0 references

full work available at URL

https://arxiv.org/abs/1912.02949

0 references

zbMATH Keywords

augmented Lagrangian

0 references

conditional gradient method

0 references

convex optimization

0 references

dimension reduction

0 references

first-order method

0 references

randomized linear algebra

0 references

semidefinite programming

0 references

sketching

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

Trust-region methods on Riemannian manifolds

0 references

Solving Euclidean distance matrix completion problems via semidefinite progrmming

0 references

Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization

0 references

Complementarity and nondegeneracy in semidefinite programming

0 references

Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results

0 references

Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver

0 references

Handbook on semidefinite, conic and polynomial optimization

0 references

A Combinatorial, Primal-Dual Approach to Semidefinite Programs

0 references

Graph Partitioning and Graph Clustering

0 references

A Randomized Mirror-Prox Method for Solving Structured Large-Scale Matrix Saddle-Point Problems

0 references

Painless reconstruction from magnitudes of frame coefficients

0 references

On signal reconstruction without phase

0 references

Q4790110

0 references

Lectures on Modern Convex Optimization

0 references

Q3690580

0 references

Manopt, a Matlab toolbox for optimization on manifolds

0 references

Fast low-rank modifications of the thin singular value decomposition

0 references

Semidefinite programming approach for the quadratic assignment problem with a sparse graph

0 references

A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization

0 references

Local minima and convergence in low-rank semidefinite programming

0 references

Solving Lift-and-Project Relaxations of Binary Integer Programs

0 references

QAPLIB - a quadratic assignment problem library

0 references

Phase retrieval from coded diffraction patterns

0 references

Array imaging using intensity-only measurements

0 references

On the Burer-Monteiro method for general semidefinite programs

0 references

Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm

0 references

Laplacian eigenvalues and the maximum cut problem

0 references

The performance of an eigenvalue bound on the max-cut problem in some classes of graphs

0 references

Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation

0 references

Sublinear time algorithms for approximate semidefinite programming

0 references

Improved Matrix Algorithms via the Subsampled Randomized Hadamard Transform

0 references

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

0 references

Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions

0 references

Sparse Approximate Solutions to Semidefinite Programs

0 references

A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training

0 references

A shortest augmenting path algorithm for dense and sparse linear assignment problems

0 references

A continuous method for computing bounds in integer quadratic optimization problems

0 references

Q2743968

0 references

Reducibility among Combinatorial Problems

0 references

Q5717954

0 references

Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start

0 references

0 references

0 references

0 references

0 references

On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming

0 references

A survey for the quadratic assignment problem

0 references

On the rank minimization problem over a positive semidefinite linear matrix inequality

0 references

SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS

0 references

Algorithms for the Assignment and Transportation Problems

0 references

Prox-Method with Rate of Convergence <i>O</i>(1/<i>t</i>) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Primal-dual subgradient methods for convex problems

0 references

Q4324980

0 references

Q4348515

0 references

On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues

0 references

P-Complete Approximation Problems

0 references

Generalized Conditional Gradient with Augmented Lagrangian for Composite Minimization

0 references

Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

0 references

SDPT3 — A Matlab software package for semidefinite programming, Version 1.3

0 references

Practical Sketching Algorithms for Low-Rank Matrix Approximation

0 references

Q3093288

0 references

Rank Optimality for the Burer--Monteiro Factorization

0 references

Alternating direction augmented Lagrangian methods for semidefinite programming

0 references

SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints

0 references

Semidefinite programming relaxations for the quadratic assignment problem

0 references

A Newton-CG Augmented Lagrangian Method for Semidefinite Programming

0 references

Identifiers

zbMATH Open document ID

1470.90068

0 references

DOI

10.1137/19M1305045

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4999352