Sparse Approximate Solutions to Semidefinite Programs
From MaRDI portal
Publication:5458538
Recommendations
Cites work
- scientific article; zbMATH DE number 5764862 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
- Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints
- Geometric algorithms and combinatorial optimization
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Note on an enumeration theorem of Davis and Slepian
- The learnability of quantum states
Cited in
(35)- An optimal-storage approach to semidefinite programming using approximate complementarity
- A semi-definite programming approach for robust tracking
- Conditional gradient algorithms for norm-regularized smooth convex optimization
- Generalized conditional gradient for sparse estimation
- Sparse PSD approximation of the PSD cone
- On Hazan's algorithm for symmetric programming problems
- Semidefinite programming approach for the quadratic assignment problem with a sparse graph
- Low-rank spectral optimization via gauge duality
- Finding low-rank solutions via nonconvex matrix factorization, efficiently and provably
- A distributed Frank-Wolfe framework for learning low-rank matrices with the trace norm
- Estimation of the parameters of a weighted nuclear norm model and its application in image denoising
- Dynamic assortment personalization in high dimensions
- Sublinear time algorithms for approximate semidefinite programming
- On the convergence of projected-gradient methods with low-rank projections for smooth convex minimization over trace-norm balls and related problems
- Frank--Wolfe Methods with an Unbounded Feasible Region and Applications to Structured Learning
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
- On lower complexity bounds for large-scale smooth convex optimization
- Approximation Bounds for Sparse Programs
- An adaptive gradient method with energy and momentum
- New analysis and results for the Frank-Wolfe method
- Screening for a reweighted penalized conditional gradient method
- Conditional Gradient Methods for Convex Optimization with General Affine and Nonlinear Constraints
- Nonsmooth projection-free optimization with functional constraints
- Efficient semidefinite branch-and-cut for MAP-MRF inference
- Complexity of linear minimization and projection on some sets
- Orthogonal rank-one matrix pursuit for low rank matrix completion
- Clustering is semidefinitely not that hard: nonnegative SDP for manifold disentangling
- A Newton Frank-Wolfe method for constrained self-concordant minimization
- Scalable semidefinite programming
- Online routing for smart electricity network under hybrid uncertainty
- Conditional gradient sliding for convex optimization
- Memory-efficient structured convex optimization via extreme point sampling
- A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization
- Exact Sparse Approximation Problems via Mixed-Integer Programming: Formulations and Computational Performance
- A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems
This page was built for publication: Sparse Approximate Solutions to Semidefinite Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458538)
