Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function
Author
Abstract
Suggested Citation
DOI: 10.1007/s10589-021-00277-4
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Anders Forsgren & Tove Odland, 2018. "On exact linesearch quasi-Newton methods for minimizing a quadratic function," Computational Optimization and Applications, Springer, vol. 69(1), pages 225-241, January.
- Nicholas Gould & Dominique Orban & Philippe Toint, 2015. "CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization," Computational Optimization and Applications, Springer, vol. 60(3), pages 545-557, April.
- David F. Shanno, 1978. "Conjugate Gradient Methods with Inexact Searches," Mathematics of Operations Research, INFORMS, vol. 3(3), pages 244-256, August.
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.- Yasushi Narushima & Shummin Nakayama & Masashi Takemura & Hiroshi Yabe, 2023. "Memoryless Quasi-Newton Methods Based on the Spectral-Scaling Broyden Family for Riemannian Optimization," Journal of Optimization Theory and Applications, Springer, vol. 197(2), pages 639-664, May.
- Matteo Lapucci & Alessio Sortino, 2024. "On the Convergence of Inexact Alternate Minimization in Problems with $$\ell _0$$ ℓ 0 Penalties," SN Operations Research Forum, Springer, vol. 5(2), pages 1-11, June.
- Yutao Zheng & Bing Zheng, 2017. "Two New Dai–Liao-Type Conjugate Gradient Methods for Unconstrained Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 175(2), pages 502-509, November.
- 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.
- Yonggang Pei & Shaofang Song & Detong Zhu, 2023. "A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization," Computational Optimization and Applications, Springer, vol. 84(3), pages 1005-1033, April.
- Fischer, Manfred M. & Staufer, Petra, 1998. "Optimization in an Error Backpropagation Neural Network Environment with a Performance Test on a Pattern Classification Problem," MPRA Paper 77810, University Library of Munich, Germany.
- 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.
- Mehiddin Al-Baali & Andrea Caliciotti & Giovanni Fasano & Massimo Roma, 2017. "Exploiting damped techniques for nonlinear conjugate gradient methods," DIAG Technical Reports 2017-05, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
- Nicholas I. M. Gould & Daniel P. Robinson, 2017. "A dual gradient-projection method for large-scale strictly convex quadratic problems," Computational Optimization and Applications, Springer, vol. 67(1), pages 1-38, May.
- Charles Audet & Kwassi Joseph Dzahini & Michael Kokkolaras & Sébastien Le Digabel, 2021. "Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates," Computational Optimization and Applications, Springer, vol. 79(1), pages 1-34, May.
- Ke-Lin Du & Chi-Sing Leung & Wai Ho Mow & M. N. S. Swamy, 2022. "Perceptron: Learning, Generalization, Model Selection, Fault Tolerance, and Role in the Deep Learning Era," Mathematics, MDPI, vol. 10(24), pages 1-46, December.
- Caliciotti, Andrea & Fasano, Giovanni & Roma, Massimo, 2018. "Preconditioned Nonlinear Conjugate Gradient methods based on a modified secant equation," Applied Mathematics and Computation, Elsevier, vol. 318(C), pages 196-214.
- Jianjun Liu & Xiangmin Xu & Xuehui Cui, 2018. "An accelerated nonmonotone trust region method with adaptive trust region for unconstrained optimization," Computational Optimization and Applications, Springer, vol. 69(1), pages 77-97, January.
- Rujun Jiang & Man-Chung Yue & Zhishuo Zhou, 2021. "An accelerated first-order method with complexity analysis for solving cubic regularization subproblems," Computational Optimization and Applications, Springer, vol. 79(2), pages 471-506, June.
- Yiwen Chen & Warren Hare & Amy Wiebe, 2024. "Q-fully quadratic modeling and its application in a random subspace derivative-free method," Computational Optimization and Applications, Springer, vol. 89(2), pages 317-360, November.
- N. Mahdavi-Amiri & M. Shaeiri, 2020. "A conjugate gradient sampling method for nonsmooth optimization," 4OR, Springer, vol. 18(1), pages 73-90, March.
- Andrea Cristofari & Marianna Santis & Stefano Lucidi & Francesco Rinaldi, 2017. "A Two-Stage Active-Set Algorithm for Bound-Constrained Optimization," Journal of Optimization Theory and Applications, Springer, vol. 172(2), pages 369-401, February.
- Andrei, Neculai, 2010. "Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization," European Journal of Operational Research, Elsevier, vol. 204(3), pages 410-420, August.
- Hanif D. Sherali & Churlzu Lim, 2007. "Enhancing Lagrangian Dual Optimization for Linear Programs by Obviating Nondifferentiability," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 3-13, February.
- S. Gratton & C. W. Royer & L. N. Vicente & Z. Zhang, 2019. "Direct search based on probabilistic feasible descent for bound and linearly constrained problems," Computational Optimization and Applications, Springer, vol. 72(3), pages 525-559, April.
- Sven Leyffer & Charlie Vanaret, 2020. "An augmented Lagrangian filter method," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 92(2), pages 343-376, October.
More about this item
Keywords
Method of conjugate gradients; Quasi-Newton method; Unconstrained quadratic program; Limited-memory method; Exact linesearch method;All these keywords.
Statistics
Access and download statisticsCorrections
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:coopap:v:79:y:2021:i:3:d:10.1007_s10589-021-00277-4. 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.