A conditional gradient homotopy method with applications to semidefinite programming
From MaRDI portal
Cites work
- A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation
- A proximal-gradient homotopy method for the sparse least-squares problem
- Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier
- Approximating K‐means‐type Clustering via Semidefinite Programming
- Approximating semidefinite packing programs
- Conditional gradient algorithms with open loop step size rules
- Distance metric learning for large margin nearest neighbor classification
- Embedded in the Shadow of the Separator
- Feasible and accurate algorithms for covering semidefinite programs
- Finding Sparse Solutions for Packing and Covering Semidefinite Programs
- Fixed-Point Continuation for \ell₁-Minimization: Methodology and Convergence
- Generalized self-concordant analysis of Frank-Wolfe algorithms
- Geometric bounds for eigenvalues of Markov chains
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Learning the kernel matrix with semidefinite programming
- Lectures on convex optimization
- Maximizing quadratic programs: extending Grothendieck's inequality
- New analysis and results for the Frank-Wolfe method
- Optimal solutions for sparse principal component analysis
- Quantum computation and quantum information. 10th anniversary edition
- Relative entropy optimization and its applications
- Scalable semidefinite programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Self-concordance and matrix monotonicity with applications to quantum entanglement problems
- Semidefinite approximations of the matrix logarithm
- Semidefinite programming and integer programming
- Separability of mixed states: necessary and sufficient conditions.
- The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
- The solution path of the generalized lasso
This page was built for publication: A conditional gradient homotopy method with applications to semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7318723)
