An Interior Point Method for Solving Semidefinite Programs Using Cutting Planes and Weighted Analytic Centers
We investigate solving semidefinite programs (SDPs) with an interior point method called SDP-CUT, which utilizes weighted analytic centers and cutting plane constraints. SDP-CUT iteratively refines the feasible region to achieve the optimal solution. The algorithm uses Newton’s method to compute the...
Main Authors: | John Machacek, Shafiu Jibrin |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2012-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2012/946893 |
Similar Items
-
The analytic center cutting plane method with semidefinite cuts /
by: Oskoorouchi, Mohammad R.
Published: (2002) -
Computing Weighted Analytic Center for Linear Matrix Inequalities Using Infeasible Newton’s Method
by: Shafiu Jibrin
Published: (2015-01-01) -
Analytic center cutting plane and path-following interior-point methods in convex programming and variational inequalities
by: Sharifi Mokhtarian, Faranak.
Published: (1997) -
Cutting-Plane Separation Strategies for Semidefinite Programming Models to Solve Single-Row Facility Layout Problems
by: Yen, Ginger
Published: (2008) -
Cutting-Plane Separation Strategies for Semidefinite Programming Models to Solve Single-Row Facility Layout Problems
by: Yen, Ginger
Published: (2008)