Pages that link to "Item:Q1373737"
From MaRDI portal
The following pages link to A cone programming approach to the bilinear matrix inequality problem and its geometry (Q1373737):
Displaying 5 items.
- On some interconnections between strict monotonicity, globally uniquely solvable, and \(P\) properties in semidefinite linear complementarity problems. (Q1405049) (← links)
- Sequential parametric convex approximation algorithm for bilinear matrix inequality problem (Q2311107) (← links)
- Lowest-rank solutions of continuous and discrete Lyapunov equations over symmetric cone (Q2451663) (← links)
- DC Programming Approaches for BMI and QMI Feasibility Problems (Q3192953) (← links)
- Branch-and-cut algorithms for the bilinear matrix inequality eigenvalue problem (Q5939945) (← links)