Augmented Lagrangian Method for Nonlinear Programming with many Complex Constraints

Article Preview

Abstract:

A method of multiplier is presented for solving optimization problems. For large-scale constraint problems, combining the active set strategy, we use the aggregate function to approximate the max-value function. Only a few of functions are involved at each iteration, so the computation for gradient is significantly reduced. The numerical results show that the method is effective.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 989-994)

Pages:

2398-2401

Citation:

Online since:

July 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] J. Nocedal, S.J. Wright, Numerical optimization (second edition), Springer, New York, (2006).

Google Scholar

[2] Y.X. Yuan, W.Y. Sun, Theory and Methods of Optimization, Science Press, Beijing, (1999).

Google Scholar

[3] E. Polak, R.S. Womersley, H.X. Yin, An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems, J. Optim. Theory Appl. 138(2008)311-328.

DOI: 10.1007/s10957-008-9355-9

Google Scholar

[4] X.S. Li, An aggregate function method for nonlinear programming, Sci. China(A) 34 (1991)1467-1473.

Google Scholar