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.
- David J. Eckman & Shane G. Henderson & Sara Shashaani, 2023. "Diagnostic Tools for Evaluating and Comparing Simulation-Optimization Algorithms," INFORMS Journal on Computing, INFORMS, vol. 35(2), pages 350-367, March.
- Brian Irwin & Eldad Haber, 2023. "Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition," Computational Optimization and Applications, Springer, vol. 84(3), pages 651-702, April.
- 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.
- S. Gratton & Ph. L. Toint, 2020. "A note on solving nonlinear optimization problems in variable precision," Computational Optimization and Applications, Springer, vol. 76(3), pages 917-933, July.
- Churlzu Lim & Hanif Sherali & Stan Uryasev, 2010. "Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization," Computational Optimization and Applications, Springer, vol. 46(3), pages 391-415, July.
- 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".
- B. Sellami & Y. Chaib, 2016. "A new family of globally convergent conjugate gradient methods," Annals of Operations Research, Springer, vol. 241(1), pages 497-513, June.
- M. Ahmadvand & M. Esmaeilbeigi & A. Kamandi & F. M. Yaghoobi, 2019. "A novel hybrid trust region algorithm based on nonmonotone and LOOCV techniques," Computational Optimization and Applications, Springer, vol. 72(2), pages 499-524, March.
- Nicolas Boutet & Rob Haelterman & Joris Degroote, 2021. "Secant Update generalized version of PSB: a new approach," Computational Optimization and Applications, Springer, vol. 78(3), pages 953-982, April.
- Neculai Andrei, 2013. "Another Conjugate Gradient Algorithm with Guaranteed Descent and Conjugacy Conditions for Large-scale Unconstrained Optimization," Journal of Optimization Theory and Applications, Springer, vol. 159(1), pages 159-182, October.
- E. G. Birgin & J. L. Gardenghi & J. M. Martínez & S. A. Santos, 2021. "On the solution of linearly constrained optimization problems by means of barrier algorithms," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(2), pages 417-441, July.
- Andrea Cristofari & Gianni Di Pillo & Giampaolo Liuzzi & Stefano Lucidi, 2022. "An Augmented Lagrangian Method Exploiting an Active-Set Strategy and Second-Order Information," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 300-323, June.
- 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.
- Jae Hwa Lee & Yoon Mo Jung & Ya-xiang Yuan & Sangwoon Yun, 2019. "A subspace SQP method for equality constrained optimization," Computational Optimization and Applications, Springer, vol. 74(1), pages 177-194, September.
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.