IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v172y2017i2d10.1007_s10957-016-0968-0.html
   My bibliography  Save this article

Constructive Solution of Inverse Parametric Linear/Quadratic Programming Problems

Author

Listed:
  • N. A. Nguyen

    (Johannes Kepler University Linz)

  • S. Olaru

    (CentraleSupélec-CNRS-UPS, Université Paris-Saclay)

  • P. Rodriguez-Ayerbe

    (CentraleSupélec-CNRS-UPS, Université Paris-Saclay)

  • M. Hovd

    (Norwegian University of Science and Technology)

  • I. Necoara

    (University Politehnica Bucharest)

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.

Suggested Citation

  • N. A. Nguyen & S. Olaru & P. Rodriguez-Ayerbe & M. Hovd & I. Necoara, 2017. "Constructive Solution of Inverse Parametric Linear/Quadratic Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 172(2), pages 623-648, February.
  • Handle: RePEc:spr:joptap:v:172:y:2017:i:2:d:10.1007_s10957-016-0968-0
    DOI: 10.1007/s10957-016-0968-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-016-0968-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10957-016-0968-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:172:y:2017:i:2:d:10.1007_s10957-016-0968-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.