Volume 41, Number 1, January-March 2007
|Page(s)||49 - 59|
|Published online||15 June 2007|
A numerical feasible interior point method for linear semidefinite programs
Département de Mathématiques, Faculté des sciences, Université Ferhat Abbas, Sétif, 19000, Algérie ; firstname.lastname@example.org; email@example.com
2 LIMOS, Université Blaise Pascal, 63177 Aubière Cedex, France; firstname.lastname@example.org
Accepted: 29 September 2006
This paper presents a feasible primal algorithm for linear semidefinite programming. The algorithm starts with a strictly feasible solution, but in case where no such a solution is known, an application of the algorithm to an associate problem allows to obtain one. Finally, we present some numerical experiments which show that the algorithm works properly.
Mathematics Subject Classification: 90C51 / 90C22 / 90C05
Key words: Linear programming / semidefinite programming / interior point methods.
© EDP Sciences, ROADEF, SMAI, 2007
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.