IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v12y1965i1p142-144.html
   My bibliography  Save this article

A Note on the Sequential Unconstrained Minimization Technique for Non-Linear Programming

Author

Listed:
  • Robert E. Stong

    (Mathematics Institute, Oxford)

Abstract

This note considers a method due to Carroll for replacing a constrained minimization problem by a sequence of unconstrained problems. Mathematical validity or convergence of this technique is shown under fairly general conditions. No computability is asserted beyond that obtained by other authors under more restrictive assumptions.

Suggested Citation

  • Robert E. Stong, 1965. "A Note on the Sequential Unconstrained Minimization Technique for Non-Linear Programming," Management Science, INFORMS, vol. 12(1), pages 142-144, September.
    • Handle: RePEc:inm:ormnsc:v:12:y:1965:i:1:p:142-144
    DOI: 10.1287/mnsc.12.1.142
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.12.1.142
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.12.1.142?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:inm:ormnsc:v:12:y:1965:i:1:p:142-144. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.