Keywords

#semidefinite_programming

Semidefinite programming

Subfield of convex optimization

Semidefinite programming (SDP) is a subfield of mathematical programming concerned with the optimization of a linear objective function over the intersection of the cone of positive semidefinite matrices with an affine space, i.e., a spectrahedron.

Wed 28th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Semidefinite programming Quantum optimization algorithms Second-order cone programming Conic optimization Quadratically constrained quadratic program Semidefinite embedding Diamond norm Sparse PCA Convex optimization Definite matrix
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.