IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v175y2017i3d10.1007_s10957-017-1180-6.html
   My bibliography  Save this article

Conjugate Direction Methods and Polarity for Quadratic Hypersurfaces

Author

Listed:
  • Giovanni Fasano

    (University Ca’ Foscari of Venice)

  • Raffaele Pesenti

    (University Ca’ Foscari of Venice)

Abstract

We use some results from polarity theory to recast several geometric properties of Conjugate Gradient-based methods, for the solution of nonsingular symmetric linear systems. This approach allows us to pursue three main theoretical objectives. First, we can provide a novel geometric perspective on the generation of conjugate directions, in the context of positive definite systems. Second, we can extend the above geometric perspective to treat the generation of conjugate directions for handling indefinite linear systems. Third, by exploiting the geometric insight suggested by polarity theory, we can easily study the possible degeneracy (pivot breakdown) of Conjugate Gradient-based methods on indefinite linear systems. In particular, we prove that the degeneracy of the standard Conjugate Gradient on nonsingular indefinite linear systems can occur only once in the execution of the Conjugate Gradient.

Suggested Citation

  • Giovanni Fasano & Raffaele Pesenti, 2017. "Conjugate Direction Methods and Polarity for Quadratic Hypersurfaces," Journal of Optimization Theory and Applications, Springer, vol. 175(3), pages 764-794, December.
  • Handle: RePEc:spr:joptap:v:175:y:2017:i:3:d:10.1007_s10957-017-1180-6
    DOI: 10.1007/s10957-017-1180-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-017-1180-6
    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-017-1180-6?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. 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).
    2. Renato Leone & Giovanni Fasano & Massimo Roma & Yaroslav D. Sergeyev, 2020. "Iterative Grossone-Based Computation of Negative Curvature Directions in Large-Scale Optimization," Journal of Optimization Theory and Applications, Springer, vol. 186(2), pages 554-589, August.
    3. G. Fasano, 2005. "Planar Conjugate Gradient Algorithm for Large-Scale Unconstrained Optimization, Part 1: Theory," Journal of Optimization Theory and Applications, Springer, vol. 125(3), pages 523-541, June.
    4. Giovanni Fasano, 2015. "A Framework of Conjugate Direction Methods for Symmetric Linear Systems in Optimization," Journal of Optimization Theory and Applications, Springer, vol. 164(3), pages 883-914, March.
    5. G. Fasano, 2005. "Planar Conjugate Gradient Algorithm for Large-Scale Unconstrained Optimization, Part 2: Application," Journal of Optimization Theory and Applications, Springer, vol. 125(3), pages 543-558, June.
    6. Giovanni Fasano & Massimo Roma, 2013. "Preconditioning Newton–Krylov methods in nonconvex large scale optimization," Computational Optimization and Applications, Springer, vol. 56(2), pages 253-290, October.
    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. Renato Leone & Giovanni Fasano & Massimo Roma & Yaroslav D. Sergeyev, 2020. "Iterative Grossone-Based Computation of Negative Curvature Directions in Large-Scale Optimization," Journal of Optimization Theory and Applications, Springer, vol. 186(2), pages 554-589, August.
    2. Renato De Leone & Giovanni Fasano & Yaroslav D. Sergeyev, 2018. "Planar methods and grossone for the Conjugate Gradient breakdown in nonlinear programming," Computational Optimization and Applications, Springer, vol. 71(1), pages 73-93, September.

    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. Giovanni Fasano, 2015. "A Framework of Conjugate Direction Methods for Symmetric Linear Systems in Optimization," Journal of Optimization Theory and Applications, Springer, vol. 164(3), pages 883-914, March.
    2. Andrea Caliciotti & Giovanni Fasano & Florian Potra & Massimo Roma, 2020. "Issues on the use of a modified Bunch and Kaufman decomposition for large scale Newton’s equation," Computational Optimization and Applications, Springer, vol. 77(3), pages 627-651, December.
    3. Giovanni Fasano & Massimo Roma, 2016. "A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization," Computational Optimization and Applications, Springer, vol. 65(2), pages 399-429, November.
    4. Giovanni Fasano & Massimo Roma, 2013. "Preconditioning Newton–Krylov methods in nonconvex large scale optimization," Computational Optimization and Applications, Springer, vol. 56(2), pages 253-290, October.
    5. Giovanni Fasano & Massimo Roma, 2011. "A Class of Preconditioners for Large Indefinite Linear Systems, as by-product of Krylov subspace Methods: Part I," Working Papers 4, Department of Management, Università Ca' Foscari Venezia.
    6. Renato De Leone & Giovanni Fasano & Yaroslav D. Sergeyev, 2018. "Planar methods and grossone for the Conjugate Gradient breakdown in nonlinear programming," Computational Optimization and Applications, Springer, vol. 71(1), pages 73-93, September.
    7. G. Fasano, 2007. "Lanczos Conjugate-Gradient Method and Pseudoinverse Computation on Indefinite and Singular Systems," Journal of Optimization Theory and Applications, Springer, vol. 132(2), pages 267-285, February.
    8. Renato Leone & Giovanni Fasano & Massimo Roma & Yaroslav D. Sergeyev, 2020. "Iterative Grossone-Based Computation of Negative Curvature Directions in Large-Scale Optimization," Journal of Optimization Theory and Applications, Springer, vol. 186(2), pages 554-589, August.
    9. 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.
    10. 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).
    11. 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.
    12. 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.
    13. 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.
    14. 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.
    15. Mehiddin Al-Baali & Andrea Caliciotti & Giovanni Fasano & Massimo Roma, 2017. "Exploiting damped techniques for nonlinear conjugate gradient methods," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 86(3), pages 501-522, December.
    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. 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.
    18. Jaroslav Fowkes & Nicholas Gould & Chris Farmer, 2013. "A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions," Journal of Global Optimization, Springer, vol. 56(4), pages 1791-1815, August.
    19. Nicholas I. M. Gould & Tyrone Rees & Jennifer A. Scott, 2019. "Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems," Computational Optimization and Applications, Springer, vol. 73(1), pages 1-35, May.
    20. Nadav Hallak & Marc Teboulle, 2020. "Finding Second-Order Stationary Points in Constrained Minimization: A Feasible Direction Approach," Journal of Optimization Theory and Applications, Springer, vol. 186(2), pages 480-503, August.

    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:175:y:2017:i:3:d:10.1007_s10957-017-1180-6. 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.