Pages that link to "Item:Q1373734"

The following pages link to The projective method for solving linear matrix inequalities (Q1373734):

Displaying 16 items.

• Nearest stable system using successive convex approximations (Q490545) (← links)
• Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions (Q1294553) (← links)
• Constraint consensus methods for finding strictly feasible points of linear matrix inequalities (Q1659091) (← links)
• A primal-dual potential reduction method for problems involving matrix inequalities (Q1922696) (← links)
• Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence (Q2007836) (← links)
• Computation of the analytic center of the solution set of the linear matrix inequality arising in continuous- and discrete-time passivity analysis (Q2022374) (← links)
• Iterative solution to linear matrix inequality arising from time delay descriptor systems (Q2350118) (← links)
• A successive constraint approach to solving parameter-dependent linear matrix inequalities (Q2363537) (← links)
• Intermittent control strategy for synchronization of fractional-order neural networks via piecewise Lyapunov function method (Q2416719) (← links)
• A primal-dual interior-point method based on various selections of displacement step for symmetric optimization (Q2419510) (← links)
• A finite steps algorithm for solving convex feasibility problems (Q2460116) (← links)
• A complex projection scheme and applications (Q2485429) (← links)
• Towards nonconservative conditions for equilibrium stability. Applications to switching systems with control delay (Q2698354) (← links)
• On the Low Rank Solutions for Linear Matrix Inequalities (Q3169010) (← links)
• An LMI approach to periodic discrete-time unbiased filtering (Q5940728) (← links)
• Robust \(\mathcal{H}_\infty\) filter design with pole constraints for discrete-time systems (Q5952978) (← links)