Abstract
In this short note, we define parametric convex programming (PCP) in a slightly different manner than it is usually done by extending convexity not only to variables but also to the parameters, and we show that the widely applied model predictive control (MPC) technique is a particular case of PCP. The main result of the note is an answer to the inverse question of PCP: which feedback laws can be generated by PCP? By employing results of convex analysis, we provide a constructive proof-yet not computational-that allows us to conclude that every continuous feedback law can be obtained by PCP.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
