The projective method for solving linear matrix inequalities
From MaRDI portal
(Redirected from Publication:1373734)
Recommendations
Cited in
(16)- On the low rank solutions for linear matrix inequalities
- A finite steps algorithm for solving convex feasibility problems
- An LMI approach to periodic discrete-time unbiased filtering
- Robust \(\mathcal{H}_\infty\) filter design with pole constraints for discrete-time systems
- Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence
- Computation of the analytic center of the solution set of the linear matrix inequality arising in continuous- and discrete-time passivity analysis
- A primal-dual interior-point method based on various selections of displacement step for symmetric optimization
- Iterative solution to linear matrix inequality arising from time delay descriptor systems
- Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions
- A complex projection scheme and applications
- Nearest stable system using successive convex approximations
- 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
- On the feasibility problem of linear matrix inequalities
- A successive constraint approach to solving parameter-dependent linear matrix inequalities
- Towards nonconservative conditions for equilibrium stability. Applications to switching systems with control delay
This page was built for publication: The projective method for solving linear matrix inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373734)
