The projective method for solving linear matrix inequalities
From MaRDI portal
Publication:1373734
zbMath0890.90142MaRDI QIDQ1373734
Pascal Gahinet, Arkadi Nemirovski
Publication date: 25 November 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
Constraint consensus methods for finding strictly feasible points of linear matrix inequalities ⋮ Intermittent control strategy for synchronization of fractional-order neural networks via piecewise Lyapunov function method ⋮ A primal-dual interior-point method based on various selections of displacement step for symmetric optimization ⋮ Towards nonconservative conditions for equilibrium stability. Applications to switching systems with control delay ⋮ A finite steps algorithm for solving convex feasibility problems ⋮ Nearest stable system using successive convex approximations ⋮ Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence ⋮ An LMI approach to periodic discrete-time unbiased filtering ⋮ Robust \(\mathcal{H}_\infty\) filter design with pole constraints for discrete-time systems ⋮ Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions
Uses Software
This page was built for publication: The projective method for solving linear matrix inequalities
