首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Constructive Solution of Inverse Parametric Linear/Quadratic Programming Problems
Authors:N A Nguyen  S Olaru  P Rodriguez-Ayerbe  M Hovd  I Necoara
Institution:1.Institute for Design and Control of Mechatronical Systems,Johannes Kepler University Linz,Linz,Austria;2.Laboratory of Signals and Systems (L2S, UMR CNRS 8506),CentraleSupélec-CNRS-UPS, Université Paris-Saclay,Gif-sur-Yvette,France;3.Department of Engineering Cybernetics,Norwegian University of Science and Technology,Trondheim,Norway;4.Automatic Control and Systems Engineering Department,University Politehnica Bucharest,Bucharest,Romania
Abstract:Parametric convex programming has received a lot of attention, since it has many applications in chemical engineering, control engineering, signal processing, etc. Further, inverse optimality plays an important role in many contexts, e.g., image processing, motion planning. This paper introduces a constructive solution of the inverse optimality problem for the class of continuous piecewise affine functions. The main idea is based on the convex lifting concept. Accordingly, an algorithm to construct convex liftings of a given convexly liftable partition will be put forward. Following this idea, an important result will be presented in this article: Any continuous piecewise affine function defined over a polytopic partition is the solution of a parametric linear/quadratic programming problem. Regarding linear optimal control, it will be shown that any continuous piecewise affine control law can be obtained via a linear optimal control problem with the control horizon at most equal to 2 prediction steps.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号