The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “On the minimum time problem in linear discrete systems with the discrete set of admissible controls”

A numerical feasible interior point method for linear semidefinite programs

Djamel Benterki, Jean-Pierre Crouzeix, Bachir Merikhi (2007)

RAIRO - Operations Research

Similarity:

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.