Initialization in semidefinite programming via a self-dual skew-symmetric embedding
نویسندگان
چکیده
The formulation of interior point algorithms for semide nite programming has become an active research area, following the success of the methods for large{ scale linear programming. Many interior point methods for linear programming have now been extended to the more general semide nite case, but the initialization problem remained unsolved. In this paper we show that the initialization strategy of embedding the problem in a self{dual skew{symmetric problem can also be extended to the semi{de nite case. This way the initialization problem of semi{de nite problems is solved. This method also provides solution for the initialization of quadratic programs and it is applicable to more general convex problems with conic formulation.
منابع مشابه
Infeasible start semidefinite programming algorithms via self - dual embeddings Report 97 - 10
The development of algorithms for semide nite programming is an active research area, based on extensions of interior point methods for linear programming. As semide nite programming duality theory is weaker than that of linear programming, only partial information can be obtained in some cases of infeasibility, nonzero optimal duality gaps, etc. Infeasible start algorithms have been proposed w...
متن کاملThe theory of linear programming: skew symmetric self-dual problems
The literature in the eld of interior point methods for linear programming has been almost exclusively algorithm oriented. Recently G uler, Roos, Terlaky and Vial presented a complete duality theory for linear programming based on the interior point approach. In this paper we present a more simple approach which is based on an embedding of the primal problem and its dual into a skew symmetric ...
متن کاملA Recurrent Neural Network Model for Solving Linear Semidefinite Programming
In this paper we solve a wide rang of Semidefinite Programming (SDP) Problem by using Recurrent Neural Networks (RNNs). SDP is an important numerical tool for analysis and synthesis in systems and control theory. First we reformulate the problem to a linear programming problem, second we reformulate it to a first order system of ordinary differential equations. Then a recurrent neural network...
متن کاملAn easy way to teach interior-point methods
A modern mathematical proof is not very diierent from a modern machine, or a modern test setup: the simple fundamental principles are hidden and almost invisible under a mass of technical details. Abstract In this paper the duality theory of Linear Optimization (LO) is built up based on ideas emerged from interior point methods. All we need is elementary calculus. We will embed the LO problem a...
متن کاملExtension and Implementation of Homogeneous Self-dual Methods for Symmetric Cones under Uncertainty
Homogeneous self-dual algorithms for stochastic semidefinite programs with finite event space has been proposed by Jin et al. in [12]. Alzalg [8], has adopted their work to derive homogeneous self-dual algorithms for stochastic second-order programs with finite event space. In this paper, we generalize these two results to derive homogeneous self-dual algorithms for stochastic programs with fin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 20 شماره
صفحات -
تاریخ انتشار 1997