DSDP3: dual scaling algorithm for general positive semidefinite programming.
Conference
·
OSTI ID:776737
We implement a dual scaling algorithm for positive semidefinite programming to handle a broader class of problems than could be solved with previous implementations of the algorithm. With appropriate representations of constraint matrices, we can solve general semidefinite programs and still exploit the structure of large-scale combinatorial optimization problems. Computational results show that our preliminary implementation is competitive with primal-dual solvers on many problems requiring moderate precision in the solution and is superior to primal-dual solvers for several types of problems.
- Research Organization:
- Argonne National Lab., IL (US)
- Sponsoring Organization:
- US Department of Energy (US)
- DOE Contract Number:
- W-31109-ENG-38
- OSTI ID:
- 776737
- Report Number(s):
- ANL/MCS/CP-104336
- Country of Publication:
- United States
- Language:
- English
Similar Records
Primal-dual interior point methods over quadratic, semidefinite and p-cones
DSDP5 user guide - software for semidefinite programming.
Complexity issues in solving III-behaved semidefinite programs
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35753
DSDP5 user guide - software for semidefinite programming.
Technical Report
·
Mon Jan 23 23:00:00 EST 2006
·
OSTI ID:947970
Complexity issues in solving III-behaved semidefinite programs
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36033