Constrained LQR Design Using Interior-Point Arc-Search Method for Convex Quadratic Programming with Box Constraints

DOI10.1007/s11075-022-01279-xzbMath1501.65022arXiv1304.4685MaRDI QIDQ6241205

Ya-Guang Yang

Publication date: 17 April 2013

Mathematics Subject Classification ID

Convex programming (90C25) Numerical optimization and variational techniques (65K10) Quadratic programming (90C20)

This page was built for publication: Constrained LQR Design Using Interior-Point Arc-Search Method for Convex Quadratic Programming with Box Constraints