IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v114y2002i2d10.1023_a1016043919978.html
   My bibliography  Save this article

Adaptive Algorithm for Constrained Least-Squares Problems

Author

Listed:
  • Z.F. Li

    (Australian National University)

  • M.R. Osborne

    (Australian National University)

  • T. Prvan

    (University of Canberra)

Abstract

This paper is concerned with the implementation and testing of an algorithm for solving constrained least-squares problems. The algorithm is an adaptation to the least-squares case of sequential quadratic programming (SQP) trust-region methods for solving general constrained optimization problems. At each iteration, our local quadratic subproblem includes the use of the Gauss–Newton approximation but also encompasses a structured secant approximation along with tests of when to use this approximation. This method has been tested on a selection of standard problems. The results indicate that, for least-squares problems, the approach taken here is a viable alternative to standard general optimization methods such as the Byrd–Omojokun trust-region method and the Powell damped BFGS line search method.

Suggested Citation

  • Z.F. Li & M.R. Osborne & T. Prvan, 2002. "Adaptive Algorithm for Constrained Least-Squares Problems," Journal of Optimization Theory and Applications, Springer, vol. 114(2), pages 423-441, August.
  • Handle: RePEc:spr:joptap:v:114:y:2002:i:2:d:10.1023_a:1016043919978
    DOI: 10.1023/A:1016043919978
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1016043919978
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1023/A:1016043919978?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Narges Bidabadi & Nezam Mahdavi-Amiri, 2014. "Superlinearly Convergent Exact Penalty Methods with Projected Structured Secant Updates for Constrained Nonlinear Least Squares," Journal of Optimization Theory and Applications, Springer, vol. 162(1), pages 154-190, July.
    2. Dominique Orban & Abel Soares Siqueira, 2020. "A regularization method for constrained nonlinear least squares," Computational Optimization and Applications, Springer, vol. 76(3), pages 961-989, July.

    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:114:y:2002:i:2:d:10.1023_a:1016043919978. 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.