Article Outline
Keywords
See also
References
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Barzilai J, Borwein M (1988) Two point step size gradient methods. IMA J Numer Anal, 8:141–148
Conn AR, Scheinberg K, Toint PL (1997) Recent progress in unconstrained nonlinear optimization without derivatives. Math Program, 79:397–414
Dennis JE, Schnabel RB (1983) Numerical methods for unconstrained optimization and nonlinear equations. Prentice-Hall, Englewood Cliffs, NJ
Fletcher R (1987) Practical methods of optimization, 2nd edn. Wiley, New York
Liu WB, Dai YH (2000) Minimization algorithms based on supervisor and searcher co-operation: I – Faster and robust gradient algorithms for minimization problems with strong noises. JOTA, accepted
Liu WB, Dai YH (2000) Minimization algorithms based on supervisor and searcher co-operation: II – Faster and robust gradient algorithms for minimization problems with strong noises. JOTA, submitted
Powell MJD (1998) Direct search algorithms for optimization calculations. Acta Numer 7(287–336
Raydan M (1993) On the BB choice of steplength for the gradient method. IMA J Numer Anal, 13:321–326
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag
About this entry
Cite this entry
Liu, W., Sirlantzis, K. (2008). SSC Minimization Algorithms . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_631
Download citation
DOI: https://doi.org/10.1007/978-0-387-74759-0_631
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-74758-3
Online ISBN: 978-0-387-74759-0
eBook Packages: Mathematics and StatisticsReference Module Computer Science and Engineering