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...
Saved in:
Main Authors: | John Machacek, Shafiu Jibrin |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2012-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2012/946893 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Computing Weighted Analytic Center for Linear Matrix Inequalities Using Infeasible Newton’s Method
by: Shafiu Jibrin
Published: (2015-01-01) -
Constraint Consensus Methods for Finding Interior Feasible Points in Second-Order Cones
by: Anna Weigandt, et al.
Published: (2010-01-01) -
Prestress Design of Tensegrity Structures Using Semidefinite Programming
by: Yafeng Wang, et al.
Published: (2019-01-01) -
A cutting-plane method with internal iteration points for the general convex programming problem
by: I. Ya. Zabotin, et al.
Published: (2024-01-01) -
A Continuous Trust-Region-Type Method for Solving Nonlinear Semidefinite Complementarity Problem
by: Ying Ji, et al.
Published: (2014-01-01)