IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v171y2016i3d10.1007_s10957-016-1007-x.html
   My bibliography  Save this article

Nonlinear Stepsize Control Algorithms: Complexity Bounds for First- and Second-Order Optimality

Author

Listed:
  • Geovani Nunes Grapiglia

    (Universidade Federal do Paraná, Centro Politécnico)

  • Jinyun Yuan

    (Universidade Federal do Paraná, Centro Politécnico)

  • Ya-xiang Yuan

    (Academy of Mathematics and Systems Science, Chinese Academy of Sciences)

Abstract

A nonlinear stepsize control (NSC) framework has been proposed by Toint (Optim Methods Softw 28:82–95, 2013) for unconstrained optimization, generalizing several trust-region and regularization algorithms. More recently, worst-case complexity bounds to achieve approximate first-order optimality were proved by Grapiglia, Yuan and Yuan (Math Program 152:491–520, 2015) for the generic NSC framework. In this paper, improved complexity bounds for first-order optimality are obtained. Furthermore, complexity bounds for second-order optimality are also provided.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:joptap:v:171:y:2016:i:3:d:10.1007_s10957-016-1007-x
    DOI: 10.1007/s10957-016-1007-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-016-1007-x
    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/s10957-016-1007-x?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.

    References listed on IDEAS

    as
    1. Ju-liang Zhang & Yong Wang, 2003. "A new trust region method for nonlinear equations," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 58(2), pages 283-298, November.
    2. 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).
    3. NESTEROV, Yurii & POLYAK, B.T., 2006. "Cubic regularization of Newton method and its global performance," LIDAM Reprints CORE 1927, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    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. Geovani N. Grapiglia & Ekkehard W. Sachs, 2017. "On the worst-case evaluation complexity of non-monotone line search algorithms," Computational Optimization and Applications, Springer, vol. 68(3), pages 555-577, December.
    2. Geovani N. Grapiglia & Gabriel F. D. Stella, 2022. "An adaptive trust-region method without function evaluations," Computational Optimization and Applications, Springer, vol. 82(1), pages 31-60, May.

    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. 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. 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.
    3. 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.
    4. Silvia Berra & Alessandro Torraca & Federico Benvenuto & Sara Sommariva, 2024. "Combined Newton-Gradient Method for Constrained Root-Finding in Chemical Reaction Networks," Journal of Optimization Theory and Applications, Springer, vol. 200(1), pages 404-427, January.
    5. Ariizumi, Shumpei & Yamakawa, Yuya & Yamashita, Nobuo, 2024. "Convergence properties of Levenberg–Marquardt methods with generalized regularization terms," Applied Mathematics and Computation, Elsevier, vol. 463(C).
    6. Seonho Park & Seung Hyun Jung & Panos M. Pardalos, 2020. "Combining Stochastic Adaptive Cubic Regularization with Negative Curvature for Nonconvex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 184(3), pages 953-971, March.
    7. Weiwei Kong & Jefferson G. Melo & Renato D. C. Monteiro, 2020. "An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems," Computational Optimization and Applications, Springer, vol. 76(2), pages 305-346, June.
    8. Kenji Ueda & Nobuo Yamashita, 2012. "Global Complexity Bound Analysis of the Levenberg–Marquardt Method for Nonsmooth Equations and Its Application to the Nonlinear Complementarity Problem," Journal of Optimization Theory and Applications, Springer, vol. 152(2), pages 450-467, February.
    9. Kenji Ueda & Nobuo Yamashita, 2014. "A regularized Newton method without line search for unconstrained optimization," Computational Optimization and Applications, Springer, vol. 59(1), pages 321-351, October.
    10. Liaoyuan Zeng & Ting Kei Pong, 2022. "$$\rho$$ ρ -regularization subproblems: strong duality and an eigensolver-based algorithm," Computational Optimization and Applications, Springer, vol. 81(2), pages 337-368, March.
    11. J. M. Martínez & L. T. Santos, 2022. "On large-scale unconstrained optimization and arbitrary regularization," Computational Optimization and Applications, Springer, vol. 81(1), pages 1-30, January.
    12. 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.
    13. Yuning Jiang & Dimitris Kouzoupis & Haoyu Yin & Moritz Diehl & Boris Houska, 2021. "Decentralized Optimization Over Tree Graphs," Journal of Optimization Theory and Applications, Springer, vol. 189(2), pages 384-407, May.
    14. Nesterov, Yurii, 2022. "Quartic Regularity," LIDAM Discussion Papers CORE 2022001, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    15. Fedor Stonyakin & Ilya Kuruzov & Boris Polyak, 2023. "Stopping Rules for Gradient Methods for Non-convex Problems with Additive Noise in Gradient," Journal of Optimization Theory and Applications, Springer, vol. 198(2), pages 531-551, August.
    16. Yuquan Chen & Yunkang Sun & Bing Wang, 2023. "Improving the Performance of Optimization Algorithms Using the Adaptive Fixed-Time Scheme and Reset Scheme," Mathematics, MDPI, vol. 11(22), pages 1-16, November.
    17. Gonglin Yuan & Zengxin Wei & Zhongxing Wang, 2013. "Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization," Computational Optimization and Applications, Springer, vol. 54(1), pages 45-64, January.
    18. Yurii Nesterov, 2021. "Superfast Second-Order Methods for Unconstrained Convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 191(1), pages 1-30, October.
    19. Naoki Marumo & Takayuki Okuno & Akiko Takeda, 2023. "Majorization-minimization-based Levenberg–Marquardt method for constrained nonlinear least squares," Computational Optimization and Applications, Springer, vol. 84(3), pages 833-874, April.
    20. Hamid Esmaeili & Morteza Kimiaei, 2016. "A trust-region method with improved adaptive radius for systems of nonlinear equations," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 83(1), pages 109-125, February.

    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:171:y:2016:i:3:d:10.1007_s10957-016-1007-x. 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: 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.