A Modified Self-Scaling Memoryless Broyden–Fletcher–Goldfarb–Shanno Method for Unconstrained Optimization
Author
Abstract
Suggested Citation
DOI: 10.1007/s10957-014-0528-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
- J. Z. Zhang & N. Y. Deng & L. H. Chen, 1999. "New Quasi-Newton Equation and Related Methods for Unconstrained Optimization," Journal of Optimization Theory and Applications, Springer, vol. 102(1), pages 147-167, July.
- Shmuel S. Oren & David G. Luenberger, 1974. "Self-Scaling Variable Metric (SSVM) Algorithms," Management Science, INFORMS, vol. 20(5), pages 845-862, January.
- Y.H. Dai & Y. Yuan, 2001. "An Efficient Hybrid Conjugate Gradient Method for Unconstrained Optimization," Annals of Operations Research, Springer, vol. 103(1), pages 33-47, March.
- Shmuel S. Oren, 1974. "Self-Scaling Variable Metric (SSVM) Algorithms," Management Science, INFORMS, vol. 20(5), pages 863-874, January.
- Avinoam Perry, 1977. "A Class of Conjugate Gradient Algorithms with a Two-Step Variable Metric Memory," Discussion Papers 269, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Parvaneh Faramarzi & Keyvan Amini, 2021. "A spectral three-term Hestenes–Stiefel conjugate gradient method," 4OR, Springer, vol. 19(1), pages 71-92, March.
- Jinbao Jian & Lin Yang & Xianzhen Jiang & Pengjie Liu & Meixing Liu, 2020. "A Spectral Conjugate Gradient Method with Descent Property," Mathematics, MDPI, vol. 8(2), pages 1-13, February.
- S. Bojari & M. R. Eslahchi, 2020. "Global convergence of a family of modified BFGS methods under a modified weak-Wolfe–Powell line search for nonconvex functions," 4OR, Springer, vol. 18(2), pages 219-244, June.
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.- Fahimeh Biglari & Farideh Mahmoodpur, 2016. "Scaling Damped Limited-Memory Updates for Unconstrained Optimization," Journal of Optimization Theory and Applications, Springer, vol. 170(1), pages 177-188, July.
- 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.
- Saman Babaie-Kafaki, 2015. "On Optimality of the Parameters of Self-Scaling Memoryless Quasi-Newton Updating Formulae," Journal of Optimization Theory and Applications, Springer, vol. 167(1), pages 91-101, October.
- Nataj, Sarah & Lui, S.H., 2020. "Superlinear convergence of nonlinear conjugate gradient method and scaled memoryless BFGS method based on assumptions about the initial point," Applied Mathematics and Computation, Elsevier, vol. 369(C).
- Martin Buhmann & Dirk Siegel, 2021. "Implementing and modifying Broyden class updates for large scale optimization," Computational Optimization and Applications, Springer, vol. 78(1), pages 181-203, January.
- M. Al-Baali, 1998. "Numerical Experience with a Class of Self-Scaling Quasi-Newton Algorithms," Journal of Optimization Theory and Applications, Springer, vol. 96(3), pages 533-553, March.
- S. Cipolla & C. Di Fiore & P. Zellini, 2020. "A variation of Broyden class methods using Householder adaptive transforms," Computational Optimization and Applications, Springer, vol. 77(2), pages 433-463, November.
- Saman Babaie-Kafaki & Reza Ghanbari, 2017. "A class of adaptive Dai–Liao conjugate gradient methods based on the scaled memoryless BFGS update," 4OR, Springer, vol. 15(1), pages 85-92, March.
- Elena Tovbis & Vladimir Krutikov & Predrag Stanimirović & Vladimir Meshechkin & Aleksey Popov & Lev Kazakovtsev, 2023. "A Family of Multi-Step Subgradient Minimization Methods," Mathematics, MDPI, vol. 11(10), pages 1-24, May.
- Kaori Sugiki & Yasushi Narushima & Hiroshi Yabe, 2012. "Globally Convergent Three-Term Conjugate Gradient Methods that Use Secant Conditions and Generate Descent Search Directions for Unconstrained Optimization," Journal of Optimization Theory and Applications, Springer, vol. 153(3), pages 733-757, June.
- Hiroyuki Sakai & Hideaki Iiduka, 2020. "Hybrid Riemannian conjugate gradient methods with global convergence properties," Computational Optimization and Applications, Springer, vol. 77(3), pages 811-830, December.
- Babaie-Kafaki, Saman & Ghanbari, Reza, 2014. "The Dai–Liao nonlinear conjugate gradient method with optimal parameter choices," European Journal of Operational Research, Elsevier, vol. 234(3), pages 625-630.
- Serge Gratton & Vincent Malmedy & Philippe Toint, 2012. "Using approximate secant equations in limited memory methods for multilevel unconstrained optimization," Computational Optimization and Applications, Springer, vol. 51(3), pages 967-979, April.
- Kin Keung Lai & Shashi Kant Mishra & Bhagwat Ram & Ravina Sharma, 2023. "A Conjugate Gradient Method: Quantum Spectral Polak–Ribiére–Polyak Approach for Unconstrained Optimization Problems," Mathematics, MDPI, vol. 11(23), pages 1-14, December.
- Priester, C. Robert & Melbourne-Thomas, Jessica & Klocker, Andreas & Corney, Stuart, 2017. "Abrupt transitions in dynamics of a NPZD model across Southern Ocean fronts," Ecological Modelling, Elsevier, vol. 359(C), pages 372-382.
- Yu, Yang & Wang, Yu & Deng, Rui & Yin, Yu, 2023. "New DY-HS hybrid conjugate gradient algorithm for solving optimization problem of unsteady partial differential equations with convection term," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 208(C), pages 677-701.
- Hassan Mohammad & Mohammed Yusuf Waziri, 2019. "Structured Two-Point Stepsize Gradient Methods for Nonlinear Least Squares," Journal of Optimization Theory and Applications, Springer, vol. 181(1), pages 298-317, April.
- Ahmad M. Alshamrani & Adel Fahad Alrasheedi & Khalid Abdulaziz Alnowibet & Salem Mahdi & Ali Wagdy Mohamed, 2022. "A Hybrid Stochastic Deterministic Algorithm for Solving Unconstrained Optimization Problems," Mathematics, MDPI, vol. 10(17), pages 1-26, August.
- M. Fatemi, 2016. "An Optimal Parameter for Dai–Liao Family of Conjugate Gradient Methods," Journal of Optimization Theory and Applications, Springer, vol. 169(2), pages 587-605, May.
- Fahimeh Biglari & Maghsud Solimanpur, 2013. "Scaling on the Spectral Gradient Method," Journal of Optimization Theory and Applications, Springer, vol. 158(2), pages 626-635, August.
More about this item
Keywords
Unconstrained optimization; Self-scaling; Conjugate gradient method; Quasi-Newton method; Global convergence; Improved Wolfe line search;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:joptap:v:165:y:2015:i:1:d:10.1007_s10957-014-0528-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.