Interior-point methods constitute a robust class of algorithms for solving constrained optimisation problems by exploring the interior of the feasible region instead of traversing its boundary. These ...

We present a general framework whereby analysis of interior-point algorithms for semidefinite programming can be extended verbatim to optimization problems over all classes of symmetric cones ...

This is a preview. Log in through your library . Abstract We present a generic projective interior point algorithm for linear programming which includes modified versions of Karmarkar's original ...