scientific article; zbMATH DE number 1495709
From MaRDI portal
Publication:4498100
Recommendations
- Low nonconvexity-rank bilinear matrix inequalities: Algorithms and applications in robust controller and structure designs
- Global optimization for the biaffine matrix inequality problem
- Branch-and-cut algorithms for the bilinear matrix inequality eigenvalue problem
- Sequential parametric convex approximation algorithm for bilinear matrix inequality problem
Cites work
- A linear matrix inequality approach to H∞ control
- A new reformulation-linearization technique for bilinear programming problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convex analysis and global optimization
- D.C. optimization approach to robust control: Feasibility problems
- Global optimization for the biaffine matrix inequality problem
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- Jointly constrained bilinear programs and related problems: An overview
- Linear Matrix Inequalities in System and Control Theory
- Semidefinite Programming
Cited in
(24)- A heuristic approach to solving a class of bilinear matrix inequality problems
- Co-design of linear systems using generalized Benders decomposition
- Robust output-feedback controller design via local BMI optimization
- Global optimization for the biaffine matrix inequality problem
- Inside-ellipsoid outside-sphere (IEOS) model for general bilinear feasibility problems: feasibility analysis and solution algorithm
- Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming
- Sequential parametric convex approximation algorithm for bilinear matrix inequality problem
- Second-order nonsmooth optimization for \(H_{\infty}\) synthesis
- On the time-reparametrization of quasi-polynomial systems
- Global optimization in stabilizing controller design
- On solving nonconvex optimization problems by reducing the duality gap
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
- Low nonconvexity-rank bilinear matrix inequalities: Algorithms and applications in robust controller and structure designs
- A BMI approach to guaranteed cost control of discrete-time uncertain system with both state and input delays
- DC Programming Approaches for BMI and QMI Feasibility Problems
- Fault-tolerant control design to enhance damping of inter-area oscillations in power grids
- Semismooth Reformulation and Nonsmooth Newton’s Method for Solving Nonlinear Semidefinite Programming
- Optimal dropout policies for networked control systems
- Branch-and-cut algorithms for the bilinear matrix inequality eigenvalue problem
- A mesh‐based partitioning algorithm for decreasing conservatism in solving bilinear matrix inequality problems
- A globally convergent SQP-type method with least constraint violation for nonlinear semidefinite programming
- Synthesizing invariant barrier certificates via difference-of-convex programming
- Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling
- Multiobjective output feedback control of a class of stochastic hybrid systems with state-dependent noise
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4498100)
