๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The polynomial solvability of convex quadratic programming

โœ Scribed by M.K. Kozlov; S.P. Tarasov; L.G. Khachiyan

Publisher
Elsevier Science
Year
1980
Weight
336 KB
Volume
20
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Computation of optimal control trajector
Computation of optimal control trajectories using Chebyshev polynomials: parameterization, and quadratic programming
โœ H. Jaddu; E. Shimemura ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 213 KB ๐Ÿ‘ 2 views

An algorithm is proposed to solve the optimal control problem for linear and nonlinear systems with quadratic performance index. The method is based on parameterizing the state variables by Chebyshev series. The control variables are obtained from the system state equations as a function of the appr