Sparse Approximate Solutions to Semidefinite Programs
From MaRDI portal
Publication:5458538
DOI10.1007/978-3-540-78773-0_27zbMath1136.90430OpenAlexW1775587472MaRDI QIDQ5458538
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
Semidefinite programming (90C22) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (29)
A distributed Frank-Wolfe framework for learning low-rank matrices with the trace norm ⋮ Sublinear time algorithms for approximate semidefinite programming ⋮ A Newton Frank-Wolfe method for constrained self-concordant minimization ⋮ Frank--Wolfe Methods with an Unbounded Feasible Region and Applications to Structured Learning ⋮ Screening for a reweighted penalized conditional gradient method ⋮ On lower complexity bounds for large-scale smooth convex optimization ⋮ Conditional gradient algorithms for norm-regularized smooth convex optimization ⋮ Memory-Efficient Structured Convex Optimization via Extreme Point Sampling ⋮ Conditional Gradient Methods for Convex Optimization with General Affine and Nonlinear Constraints ⋮ An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity ⋮ A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization ⋮ Estimation of the parameters of a weighted nuclear norm model and its application in image denoising ⋮ New analysis and results for the Frank-Wolfe method ⋮ Efficient semidefinite branch-and-cut for MAP-MRF inference ⋮ Low-Rank Spectral Optimization via Gauge Duality ⋮ Conditional Gradient Sliding for Convex Optimization ⋮ Dynamic Assortment Personalization in High Dimensions ⋮ Complexity of linear minimization and projection on some sets ⋮ Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably ⋮ Generalized Conditional Gradient for Sparse Estimation ⋮ Unnamed Item ⋮ Online routing for smart electricity network under hybrid uncertainty ⋮ Scalable Semidefinite Programming ⋮ On the Convergence of Projected-Gradient Methods with Low-Rank Projections for Smooth Convex Minimization over Trace-Norm Balls and Related Problems ⋮ Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion ⋮ A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems ⋮ On Hazan's algorithm for symmetric programming problems ⋮ An Adaptive Gradient Method with Energy and Momentum ⋮ A semi-definite programming approach for robust tracking
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Note on an enumeration theorem of Davis and Slepian
- Geometric algorithms and combinatorial optimization
- The learnability of quantum states
- 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
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
This page was built for publication: Sparse Approximate Solutions to Semidefinite Programs
