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

Cubic regularization of a Newton scheme and its global performance

Author

Listed:
  • NESTEROV, Yurii
  • POLYAK, Boris

Abstract

In this paper we suggest a cubic regularization for a Newton method as applied to unconstrained minimization problem. For this scheme we prove general convergence results. We analyze the behavior of this scheme on different problem classes, for which we get global and local worst-case complexity bounds. It is shown that the search direction can be computed by a standard linear algebra technique.

Suggested Citation

  • NESTEROV, Yurii & POLYAK, Boris, 2003. "Cubic regularization of a Newton scheme and its global performance," LIDAM Discussion Papers CORE 2003041, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  • Handle: RePEc:cor:louvco:2003041
    as

    Download full text from publisher

    File URL: https://sites.uclouvain.be/core/publications/coredp/coredp2003.html
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. B. T. Polyak, 1998. "Convexity of Quadratic Transformations and Its Use in Control and Optimization," Journal of Optimization Theory and Applications, Springer, vol. 99(3), pages 553-583, December.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Polyak, B.T., 2007. "Newton's method and its use in optimization," European Journal of Operational Research, Elsevier, vol. 181(3), pages 1086-1096, September.
    2. NESTEROV, Yu, 2003. "Modified Gauss-Newton scheme with worst-case guarantees for its global performance," LIDAM Discussion Papers CORE 2003086, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. NESTEROV, Yu., 2006. "Cubic regularization of Newton’s method for convex problems with constraints," LIDAM Discussion Papers CORE 2006039, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. de Klerk, E., 2006. "The Complexity of Optimizing over a Simplex, Hypercube or Sphere : A Short Survey," Discussion Paper 2006-85, Tilburg University, Center for Economic Research.
    2. J. B. Lasserre & J. B. Hiriart-Urruty, 2002. "Mathematical Properties of Optimization Problems Defined by Positively Homogeneous Functions," Journal of Optimization Theory and Applications, Springer, vol. 112(1), pages 31-52, January.
    3. A. Baccari & B. Samet, 2009. "An Extension of Polyak’s Theorem in a Hilbert Space," Journal of Optimization Theory and Applications, Springer, vol. 140(3), pages 409-418, March.
    4. Shenglong Hu & Guoyin Li & Liqun Qi, 2016. "A Tensor Analogy of Yuan’s Theorem of the Alternative and Polynomial Optimization with Sign structure," Journal of Optimization Theory and Applications, Springer, vol. 168(2), pages 446-474, February.
    5. B. S. Mordukhovich & M. E. Sarabi, 2017. "Stability Analysis for Composite Optimization Problems and Parametric Variational Systems," Journal of Optimization Theory and Applications, Springer, vol. 172(2), pages 554-577, February.
    6. Etienne Klerk, 2008. "The complexity of optimizing over a simplex, hypercube or sphere: a short survey," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 16(2), pages 111-125, June.
    7. Huu-Quang Nguyen & Ruey-Lin Sheu, 2019. "Geometric properties for level sets of quadratic functions," Journal of Global Optimization, Springer, vol. 73(2), pages 349-369, February.
    8. Immanuel Bomze & Markus Gabl, 2021. "Interplay of non-convex quadratically constrained problems with adjustable robust optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(1), pages 115-151, February.
    9. Guoyin Li, 2012. "Global Quadratic Minimization over Bivalent Constraints: Necessary and Sufficient Global Optimality Condition," Journal of Optimization Theory and Applications, Springer, vol. 152(3), pages 710-726, March.
    10. de Klerk, E., 2006. "The Complexity of Optimizing over a Simplex, Hypercube or Sphere : A Short Survey," Other publications TiSEM 88640b6d-5240-472d-8669-4, Tilburg University, School of Economics and Management.
    11. Sheng-Long Hu & Zheng-Hai Huang, 2012. "Theorems of the Alternative for Inequality Systems of Real Polynomials," Journal of Optimization Theory and Applications, Springer, vol. 154(1), pages 1-16, July.
    12. Wenbao Ai & Yongwei Huang & Shuzhong Zhang, 2008. "On the Low Rank Solutions for Linear Matrix Inequalities," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 965-975, November.
    13. A. Beck, 2009. "Convexity Properties Associated with Nonconvex Quadratic Matrix Functions and Applications to Quadratic Programming," Journal of Optimization Theory and Applications, Springer, vol. 142(1), pages 1-29, July.
    14. V. Jeyakumar & G. Li, 2013. "Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty," Journal of Global Optimization, Springer, vol. 55(2), pages 209-226, February.
    15. Meijia Yang & Shu Wang & Yong Xia, 2022. "Toward Nonquadratic S-Lemma: New Theory and Application in Nonconvex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 194(1), pages 353-363, July.
    16. Fabián Flores-Bazán & William Echegaray & Fernando Flores-Bazán & Eladio Ocaña, 2017. "Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap," Journal of Global Optimization, Springer, vol. 69(4), pages 823-845, December.
    17. C. Durieu & É. Walter & B. Polyak, 2001. "Multi-Input Multi-Output Ellipsoidal State Bounding," Journal of Optimization Theory and Applications, Springer, vol. 111(2), pages 273-303, November.
    18. Zhuoyi Xu & Linbin Li & Yong Xia, 2023. "A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 98(1), pages 93-109, August.
    19. H. Tuy & H. Tuan, 2013. "Generalized S-Lemma and strong duality in nonconvex quadratic programming," Journal of Global Optimization, Springer, vol. 56(3), pages 1045-1072, July.
    20. de Klerk, E., 2008. "The complexity of optimizing over a simplex, hypercube or sphere : A short survey," Other publications TiSEM 485b6860-cf1d-4cad-97b8-2, Tilburg University, School of Economics and Management.

    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:louvco:2003041. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.