Pages that link to "Item:Q2311107"
From MaRDI portal
The following pages link to Sequential parametric convex approximation algorithm for bilinear matrix inequality problem (Q2311107):
Displaying 10 items.
- A sequential LCP method for bilevel linear programming (Q1184523) (← links)
- Finite-frequency fixed-order dynamic output-feedback control via a homogeneous polynomially parameter-dependent technique (Q2101968) (← links)
- Approximate methods for convex minimization problems with series-parallel structure (Q2482762) (← links)
- Low nonconvexity-rank bilinear matrix inequalities: Algorithms and applications in robust controller and structure designs (Q2730292) (← links)
- A new Lagrangian dual global optimization algorithm for solving bilinear matrix inequalities (Q4498100) (← links)
- Decision bounding problems for two-stage distributionally robust stochastic bilevel optimization (Q6064042) (← links)
- A mesh‐based partitioning algorithm for decreasing conservatism in solving bilinear matrix inequality problems (Q6081030) (← links)
- A successive convex optimization method for bilinear matrix inequality problems and its application to static output‐feedback control (Q6082402) (← links)
- Bilinear matrix inequality‐based nonquadratic controller design for polytopic‐linear parameter varying systems (Q6082925) (← links)
- Resilient control co-design for cyber-physical systems with DoS attacks via a successive convex optimization approach (Q6099903) (← links)
