IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v54y2001i1p53-61.html
   My bibliography  Save this article

Identifying non-active restrictions in convex quadratic programming

Author

Listed:
  • Peter Recht

Abstract

Convex quadratic programming (QP) is of reviving interest in the last few years, since in connection with interior point methods Sequential Quadratic Programming (SQP) has been assessed as a powerful algorithmic scheme for solving nonlinear constraint optimization problems. In this paper we contribute to the investigation of detecting constraints that cannot be active at an optimal point of a QP-problem. It turns out that simple calculations performed at the beginning of (or even during) an optimization procedure allow early decisions on the deletion of such superfluous restrictions. For feasible point procedures or active set strategies such information are essential to shrink down the problem size and to speed up iterations. For practical applications the necessary computations only depend on data of the QP-problem. Comparing those quantities with (current) values of the objective function deliver conditions for the elimination of constraints. Copyright Springer-Verlag Berlin Heidelberg 2001

Suggested Citation

  • Peter Recht, 2001. "Identifying non-active restrictions in convex quadratic programming," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 54(1), pages 53-61, October.
    • Handle: RePEc:spr:mathme:v:54:y:2001:i:1:p:53-61
    DOI: 10.1007/s001860100145
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860100145
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001860100145?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:mathme:v:54:y:2001:i:1:p:53-61. 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.