Semidefinite programming

European Journal of Operational Research

Volumn 137, Issue 3, 2002, Pages 461-482

  Helmberg, C ^a  

^a ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

Interior point methods; Semidefinite duality; Semidefinite programs; Spectral bundle method

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONTROL THEORY; EIGENVALUES AND EIGENFUNCTIONS; MATHEMATICAL MODELS; MATRIX ALGEBRA; OPERATIONS RESEARCH; QUADRATIC PROGRAMMING;

SEMIDEFINITE PROGRAMMING;

LINEAR PROGRAMMING;

EID: 0037117180     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(01)00143-6     Document Type: Article

References (46)

1. Primal-dual interior-point methods for semidefinite programming: Convergence rates, stability and numerical results
2. Cones of diagonally dominant matrices
3. Robust truss topology design via semidefinite programming
4. Robust convex optimization
5. Solving large-scale sparse semidefinite programs for combinatorial optimization
6. Sensitivity analysis of optimization problems under second order regular constraints
7. Linear matrix inequalities in system and control theory
8. The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices
9. Initialization in semidefinite programming via a self-dual skew-symmetric embedding
10. Combinatorial properties and the complexity of a max-cut approximation
11. Improved approximation algorithms for MAX k-CUT and MAX BISECTION
12. Semidefinite programming in combinatorial optimization
13. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
14. Geometric algorithms and combinatorial optimization
15. Fixing variables in semidefinite relaxations
16. Incorporating inequality constraints in the spectral bundle method
17. A spectral bundle method for semidefinite programming
18. An interior-point method for semidefinite programming
19. Approximate graph coloring by semidefinite programming
20. Integer optimization on convex semialgebraic sets
21. Proximity control in bundle methods for convex nondifferentiable minimization
22. Reduction of monotone linear complementarity problems over cones to linear programs over cones
23. Interior-point methods for the monotone linear complementarity problem in symmetric matrices
24. Eigenvalue optimization
25. Cones of matrices and set-functions and 0-1 optimization
26. Polynomial convergence of primal-dual algorithms for semidefinite programming based on Monteiro and Zhang family of directions
27. Interior-point polynomial algorithms in convex programming
28. Self-scaled barriers and interior-point methods for convex programming
29. Primal-dual interior-point methods for self-scaled cones
30. A second-order bundle method to minimize the maximum eigenvalue function
31. Large-scale optimization of eigenvalues
32. On the rank of extreme matrices in semidefinite programming and the multiplicity of optimal eigenvalues
33. Nondifferentiable optimization algorithm for designing control systems having singular value inequalities
34. On the complexity of semidefinite programs
35. An exact duality theory for semidefinite programming and its complexity implications
36. Quadratic optimization problems
37. A study of search directions in primal-dual interior-point methods for semidefinite programming
38. Semidefinite programming
39. Some applications of optimization in matrix theory
40. On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming