A New Type of Optimization Method Based on Conjugate Directions

Xin Pan

doi:10.4028/www.scientific.net/AMM.347-350.3029

Paper Titles

A Relation Oriented System Analysis Method
p.3008

A Wavelet Neural Network Forecasting Model Based on ARIMA
p.3013

Fractal Structures of General Mandelbrot Sets and Julia Sets Generated from Complex Non-Analytic Iteration F_m(z)=z¯^m+c
p.3019

SAR Image Classification Based on Brushlet and Self-Adaptive Ridgelet Neural Network
p.3024

A New Type of Optimization Method Based on Conjugate Directions
p.3029

Study on Personalized Recommendation Technology of Digital TV Programs
p.3035

The Liquid and Plastic Limit Data Treated System Based on VC++
p.3039

In C Language How to Use Pointer to Access Two-Dimensional Array Element
p.3044

The Post Ability Evaluation of Maintenance Personnel Based on the G1-Topsis Algorithm
p.3051

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 347-350A New Type of Optimization Method Based on...

A New Type of Optimization Method Based on Conjugate Directions

Abstract:

A new type of optimization method based on conjugate directions is proposed in this paper. It can be proved that this type of method has quadratic termination property without exact line search. The new method requires only the storage of 4 vectors such that it is suitable for large scale problems. Numerical experiences show that the new method is effective.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 347-350)

Pages:

3029-3034

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.347-350.3029

Citation:

Cite this paper

Online since:

August 2013

Authors:

Xin Pan

Keywords:

Conjugate Directions, Large Scale Problems, Optimization, Quadratic Termination Property

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Fletcher R. and Reeves C.M. Function Minimization by Conjugate Gradients[J]. Computer Journal, 1964, 7 : 149-154.

Google Scholar

[2] Sorenson H. W. Comparision of some conjugate direction procedures for function minimization [J]. Journal of the Franklin Institute 1969, 288 : 421-441.

DOI: 10.1016/0016-0032(69)90253-1

Google Scholar

[3] Liu Y., Storey C. Efficient generalized conjugate gradient algorithms[J]. Journal of optimization theory and applications, 1991, 69: 129-153.

DOI: 10.1007/bf00940464

Google Scholar

[4] Dai Y. and Yuan Y. Nonlinear Conjugate Gradient Methods [M]. Shanghai: Shanghai Science and Technology Press, (2001).

Google Scholar

[5] Yuan Y. and Stoer J. A subspace study on conjugate algorithms[J]. ZAMM Z. angew. Math. Meth. 1995, 75(11): 69-77.

DOI: 10.1002/zamm.19950750118

Google Scholar

[6] Nocedal J. and Wright S. J. Numerical Optimization[M]. Springer Series in Operations Research. New York: Springer-Verlag, (1999).

Google Scholar

[7] [onn A. R., Gould N. L. M., and Sartenaer A., etal On Interated-Subspace minimization methods for nonlinear optimization[A]. L. Adams and L. Nazareth, Linear and Nonlinear conjugate gradient related methods[C]. AMS-IMS-SIAM. 1996: 50-78.

Google Scholar

[8] Dennis J. E. and Schnabel R.B. Numerical methods for unconstrained optimization and nonlinear equations[M]. Prentice-Hall Englewood Cliffs, NJ, (1983).

Google Scholar