scientific article; zbMATH DE number 7008338
From MaRDI portal
Publication:4614130
zbMath1482.90139arXiv1706.06028MaRDI QIDQ4614130
Mariano Tepper, Dmitri B. Chklovskii, Anirvan M. Sengupta
Publication date: 30 January 2019
Full work available at URL: https://arxiv.org/abs/1706.06028
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Conic optimization via operator splitting and homogeneous self-dual embedding
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- On nonnegative factorization of matrices
- An alternating direction algorithm for matrix completion with nonnegative factors
- On semidefinite relaxations for the block model
- Invariant Semidefinite Programs
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
- Phase transitions in semidefinite relaxations
- Relax, No Need to Round
- Algorithms for Nonnegative Matrix Factorization with the β-Divergence
- The Split Bregman Method for L1-Regularized Problems
- On the Matrix Equation X′X = A
- Clustering subgaussian mixtures by semidefinite programming
- Compressed Nonnegative Matrix Factorization Is Fast and Accurate
- Least squares quantization in PCM
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- A Limited Memory Algorithm for Bound Constrained Optimization
- Deterministic Guarantees for Burer‐Monteiro Factorizations of Smooth Semidefinite Programs
- A Biclustering Framework for Consensus Problems
- Approximating K‐means‐type Clustering via Semidefinite Programming
- Sparse Approximate Solutions to Semidefinite Programs
This page was built for publication:
