IDEAS home Printed from https://ideas.repec.org/p/cor/louvrp/1952.html
   My bibliography  Save this paper

Gauss-Newton scheme with worst case guarantees for global performance

Author

Listed:
  • NESTEROV, Yurii

Abstract

No abstract is available for this item.

Suggested Citation

  • NESTEROV, Yurii, 2007. "Gauss-Newton scheme with worst case guarantees for global performance," LIDAM Reprints CORE 1952, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvrp:1952
    DOI: 10.1080/08927020600643812
    Note: In : Optimization Methods and Software, 22(3), 469-483, 2007
    as

    Download full text from publisher

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

    Citations

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


    Cited by:

    1. Kenji Ueda & Nobuo Yamashita, 2010. "On a Global Complexity Bound of the Levenberg-Marquardt Method," Journal of Optimization Theory and Applications, Springer, vol. 147(3), pages 443-453, December.
    2. Tommaso Bianconcini & Giampaolo Liuzzi & Benedetta Morini & Marco Sciandrone, 2015. "On the use of iterative methods in cubic regularization for unconstrained optimization," Computational Optimization and Applications, Springer, vol. 60(1), pages 35-57, January.
    3. Yakui Huang & Hongwei Liu, 2016. "Smoothing projected Barzilai–Borwein method for constrained non-Lipschitz optimization," Computational Optimization and Applications, Springer, vol. 65(3), pages 671-698, December.
    4. Nikita Doikov & Yurii Nesterov, 2021. "Minimizing Uniformly Convex Functions by Cubic Regularization of Newton Method," Journal of Optimization Theory and Applications, Springer, vol. 189(1), pages 317-339, April.
    5. Boris Polyak & Andrey Tremba, 2020. "Sparse solutions of optimal control via Newton method for under-determined systems," Journal of Global Optimization, Springer, vol. 76(3), pages 613-623, March.
    6. Mahesh Chandra Mukkamala & Jalal Fadili & Peter Ochs, 2022. "Global convergence of model function based Bregman proximal minimization algorithms," Journal of Global Optimization, Springer, vol. 83(4), pages 753-781, August.
    7. Geovani Nunes Grapiglia & Jinyun Yuan & Ya-xiang Yuan, 2016. "Nonlinear Stepsize Control Algorithms: Complexity Bounds for First- and Second-Order Optimality," Journal of Optimization Theory and Applications, Springer, vol. 171(3), pages 980-997, December.

    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:cor:louvrp:1952. 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: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.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.