Presentation is loading. Please wait.

Presentation is loading. Please wait.

Introduction to Semidefinite Programs Masakazu Kojima Semidefinite Programming and Its Applications Institute for Mathematical Sciences National University.

Similar presentations


Presentation on theme: "Introduction to Semidefinite Programs Masakazu Kojima Semidefinite Programming and Its Applications Institute for Mathematical Sciences National University."— Presentation transcript:

1

2 Introduction to Semidefinite Programs Masakazu Kojima Semidefinite Programming and Its Applications Institute for Mathematical Sciences National University of Singapore Jan 9 -13, 2006

3 Main purpose Introduction of semidefinite programs Brief review of SDPs Part I: Introduction to SDP and its basic theory --- 70 minutes Part II: Primal-dual interior-point methods --- 70 minutes Part III: Some applications Appendix: Linear optimization problems over symmetric cones Contents References --- Not comprehensive but helpful for further study of the subject ---

4 Contents Part I: Introduction to SDP and its basic theory 1. LP versus SDP 2. Why is SDP interesting and important? 3. The equality standard form 4. Some basic properties on positive semidefinite matrices and their inner product 5. General SDPs 6. Some examples 7. Duality Part II: Primal-dual interior-point methods 1. Existing numerical methods for SDPs 2. Three approaches to primal-dual interior-point methods for SDPs 3. The central trajectory 4. Search directions 5. Various primal-dual interior-point methods 6. Exploiting sparsity 7. Software packages 8. SDPA sparse format 9. Numerical results

5 Part III: Some applications 1. Matrix approximation problems 2. A nonconvex quadratic optimization problem 3. The max-cut problem 4. Sum of squares of polynomials Appendix: Linear optimization problems over symmetric cones 1. Linear optimization problems over cones 2. Symmetric cones 3. Euclidean Jordan algebra 4. SOCP (Second Order Cone Program) 5. Some applications of SOCPs

6 Part I: Introduction to SDP and its basic theory 1. LP versus SDP 2. Why is SDP interesting and important? 3. The equality standard form 4. Some basic properties on positive semidefinite matrices and their inner product 5. General SDPs 6. Some examples 7. Duality

7

8

9

10

11

12

13 Classification of Optimization Problems ContinuousDiscreteConvex Nonconvex Linear Optimization Problem over Symmetric Cone SemiDefinite Program Second Order Cone Program Convex Quadratic Optimization Problem Linear Program Polynomial Optimization Problem 0-1 Integer LP & QOP relaxation POP over Symmetric Cone Bilinear Matrix Inequality | | | |

14 Part I: Introduction to SDP and its basic theory 1. LP versus SDP 2. Why is SDP interesting and important? 3. The equality standard form 4. Some basic properties on positive semidefinite matrices and their inner product 5. General SDPs 6. Some examples 7. Duality

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37 Part I: Introduction to SDP and its basic theory 1. LP versus SDP 2. Why is SDP interesting and important? 3. The equality standard form SDP 4. Some basic properties on positive semidefinite matrices and their inner product 5. General SDPs 6. Some examples 7. Duality

38

39

40

41

42

43

44 Part II: Primal-dual interior-point methods 1. Existing numerical methods for SDPs 2. Three approaches to primal-dual interior-point methods for SDPs 3. The central trajectory 4. Search directions 5. Various primal-dual interior-point methods 6. Exploiting sparsity 7. Software packages 8. SDPA sparse format 9. Numerical results

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83 Part II: Primal-dual interior-point methods 1. Existing numerical methods for SDPs 2. Three approaches to primal-dual interior-point methods for SDPs 3. The central trajectory 4. Search directions 5. Various primal-dual interior-point methods. 6. Exploiting sparsity 7. Software packages 8. SDPA sparse format 9. Numerical results

84

85 Part II: Primal-dual interior-point methods 1. Existing numerical methods for SDPs 2. Three approaches to primal-dual interior-point methods for SDPs 3. The central trajectory 4. Search directions 5. Various primal-dual interior-point methods 6. Exploiting sparsity 7. Software packages 8. SDPA sparse format 9. Numerical results

86

87

88

89

90 Part III: Some applications 1. Matrix approximation problems 2. A nonconvex quadratic optimization problem 3. The max-cut problem 4. Sum of squares of polynomials

91

92

93

94

95

96

97

98

99

100

101

102

103

104

105

106

107

108

109

110

111 Appendix: Linear optimization problems over symmetric cones 1. Linear optimization problems over cones 2. Symmetric cones 3. Euclidean Jordan algebra 4. SOCP (Second Order Cone Program) 5. Some applications of SOCPs

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134 References

135

136

137

138


Download ppt "Introduction to Semidefinite Programs Masakazu Kojima Semidefinite Programming and Its Applications Institute for Mathematical Sciences National University."

Similar presentations


Ads by Google