An efficient representation for linear constraints

DOI10.1109/9.58510MaRDI QIDQ5202080zbMATH OpenOpenAlexFDO

Authors Colin D. Tebbutt

Publication date 1990

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/9.58510

zbMATH Keywords

quadratic programming algorithm

Mathematics Subject Classification ID

Quadratic programming (90C20)

Recommendations

• A new CAD method and associated architectures for linear controllers
• Feasibility and constraint analysis of sets of linear matrix inequalities
• Minimal representation of quadratically constrained convex feasible regions
• The design of a linear regulator based on an integral-equation representation
• scientific article; zbMATH DE number 4061088

Cited in

(9)

• A canonical form for generalized linear constraints
• An efficient linearity-and-bound-preserving remapping method
• Efficient searching with linear constraints
• Efficient solution and computation of models with occasionally binding constraints
• An algorithm-independent measure of progress for linear constraint propagation
• A linear-time transformation of linear inequalities into conjunctive normal form
• Static Analysis
• An expert system for multivariable controller design
• Propagating systems of dense linear integer constraints

This page was built for publication: An efficient representation for linear constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202080)