Sparse Approximate Solutions to Semidefinite Programs
From MaRDI portal
Publication:5458538
DOI10.1007/978-3-540-78773-0_27zbMATH Open1136.90430OpenAlexW1775587472MaRDI QIDQ5458538FDOQ5458538
Authors: Elad Hazan 
Publication date: 15 April 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_27
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Semidefinite programming (90C22)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
- Title not available (Why is that?)
- Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints
- Note on an enumeration theorem of Davis and Slepian
- The learnability of quantum states
Cited In (35)
- 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
- Low-rank spectral optimization via gauge duality
- Semidefinite programming approach for the quadratic assignment problem with a sparse graph
- 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
- Dynamic assortment personalization in high dimensions
- Estimation of the parameters of a weighted nuclear norm model and its application in image denoising
- 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
- Conditional gradient sliding for convex optimization
- Online routing for smart electricity network under hybrid uncertainty
- A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization
- Memory-efficient structured convex optimization via extreme point sampling
- 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
- An optimal-storage approach to semidefinite programming using approximate complementarity
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)
