Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

A numerical feasible interior point method for linear semidefinite programs

Djamel BenterkiJean-Pierre CrouzeixBachir Merikhi — 2007

RAIRO - Operations Research

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.

Page 1

Download Results (CSV)