The following pages link to CSDP 2.3 user's guide (Q4504794):
Displaying 11 items.
- CSDP (Q12937) (← links)
- Abstract interpretation meets convex optimization (Q435969) (← links)
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming (Q623727) (← links)
- A convex relaxation bound for subgraph isomorphism (Q666533) (← links)
- Successive linearization methods for nonlinear semidefinite programs (Q812426) (← links)
- On filter-successive linearization methods for nonlinear semidefinite programming (Q1047869) (← links)
- Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming (Q1349146) (← links)
- A new branch and bound method for a discrete truss topology design problem (Q1938912) (← links)
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization (Q1949261) (← links)
- Semidefinite programming for uncertain linear equations in static analysis of structures (Q2638116) (← links)
- Robust Network Design with Uncertain Outsourcing Cost (Q3458750) (← links)
