Advances in Linear Matrix Inequality Methods in Control 2000
DOI: 10.1137/1.9780898719833.ch4
|View full text |Cite
|
Sign up to set email alerts
|

4. sdpsol: A Parser/Solver for Semidefinite Programs with Matrix Structure

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0

Year Published

2007
2007
2011
2011

Publication Types

Select...
3
2
1

Relationship

2
4

Authors

Journals

citations
Cited by 17 publications
(21 citation statements)
references
References 0 publications
0
21
0
Order By: Relevance
“…Currently, several programmes such as SDPA [10], CSDP [4], DSDP [3] and SDPSOL [28] are already available. Hence from a practical point of view, the key process to optimise contributions using SDP is to re-cast the problem in the standard form as shown here.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Currently, several programmes such as SDPA [10], CSDP [4], DSDP [3] and SDPSOL [28] are already available. Hence from a practical point of view, the key process to optimise contributions using SDP is to re-cast the problem in the standard form as shown here.…”
Section: Discussionmentioning
confidence: 99%
“…Currently, several general purpose programmes for solving SDP are already available (e.g. SDPA [10], CSDP [4], DSDP [3], SDPSOL [28]). Hence, from a practical point of view, the key process for using semidefinite programming is demonstrating the problem is convex and reformulating it in the standard form represented by (2), ready for using the available programmes.…”
Section: Optimisation Using Semidefinite Programming (Sdp)mentioning
confidence: 99%
“…All the methods were run on the same computer. We used Matlab to implement all the methods, except SDP for which we used a SDP solver [Wu and Boyd 1996]. From the table we see that the SDP and gradient descent methods, are lightning fast.…”
Section: Empirical Comparison Of the Cdf Computing Methodsmentioning
confidence: 99%
“…The domain of the random variable is [a, c]. Solving this semidefinite program yields an upper bound on the cdf P [X <= b], where a ≤ b ≤ c. We used a free online SDP solver [Wu and Boyd 1996] to solve the preceding semidefinite program. Through empirical studies that follow we found this approach to be the best in solving the optimization problem in terms of a balance between speed, reliability, and accuracy.…”
Section: Sequential Quadratic Programming (Sqp)mentioning
confidence: 99%
“…Developed by Shao-Po Wu and Stephen Boyd [51,52], it was solving SDPs and determinant maximization problems. It was last updated in 1996.…”
Section: Sdpsolmentioning
confidence: 99%