IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v6y2025i1d10.1007_s43069-024-00403-y.html
   My bibliography  Save this article

Using Estimated Gradients in Bound-Constrained Global Optimization

Author

Listed:
  • C. J. Price

    (University of Canterbury)

  • B. L. Robertson

    (University of Canterbury)

Abstract

A method for bound-constrained global optimization which uses estimated gradients is presented. The objective function is assumed to have a Lipschitz continuous gradient. This method alternates between a local trust region method using a quasi-Newton Hessian approximation and random search on the feasible region $$\Omega $$ Ω and selected subsets of $$\Omega $$ Ω . The local trust region subproblem is incompletely solved using Steihaug-Toint conjugate gradients. Convergence is shown almost surely, and the local trust region algorithm’s convergence properties are shown independently. The method was tested on 55 standard test problems in 2–60 dimensions, and further randomly generated Schoen functions. Results show the method is competitive and robust in the face of ill-conditioning and that using estimated or analytic gradients can be beneficial.

Suggested Citation

  • C. J. Price & B. L. Robertson, 2025. "Using Estimated Gradients in Bound-Constrained Global Optimization," SN Operations Research Forum, Springer, vol. 6(1), pages 1-24, March.
    • Handle: RePEc:spr:snopef:v:6:y:2025:i:1:d:10.1007_s43069-024-00403-y
    DOI: 10.1007/s43069-024-00403-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-024-00403-y
    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/s43069-024-00403-y?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:snopef:v:6:y:2025:i:1:d:10.1007_s43069-024-00403-y. 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.