Abstract
In this paper, we presented a kind of nonmonotone QP-free method based on a new piecewise linear NCP functions.Each iteration in this algorithm only needs to solve systems of linear equations which are derived from the equality part in the KKT first order optimality conditions.The initial point is arbitrary. Instead of filter methods, we use a nonmonotone technique to avoid the estimation of the penalty parameter which is always difficult to obtain. Under some conditions, the global convergence of the algorithm is given. Some numerical results are presented.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Panier, E.R., Tits, A.L., Herskovits, J.N.: A QP-free, globally, locally superlinear convergent method for the inequality constrained optimizaiton problems. SIAM J. Control Optim. 36, 788–811 (1988)
Herskovits, J.N.: A two-stage feasible direction algorithm for nonlinear constrained optimization. Math. Program 36, 19–38 (1986)
Zhu, Z.B.: A globally and superlinearly convergent feasible QP-free method for nonlinear programming. Appl. Math. Compt. 168, 519–539 (2005)
Hock, W., Schittkowski, K.: Test Example for Nonlinear Programming Codes. Lecture Notes in Econom. and Math. Systems, vol. 187. Springer, Berlin (1981)
Zhou, Y., Pu, D.G.: A new QP-free feasible method for inequality constrained optimization. Math. Methods Oper. Res. 11, 31–43 (2007)
Fletcher, R., Leyffer, S., Toint, P.L.: On the global convergence of a filter-SQP algorithm. SIAM J. Optim. 13, 44–59 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, H. (2009). A Kind of Nonmonotone QP-Free Method for Constrained Optimization. In: Cao, B., Li, TF., Zhang, CY. (eds) Fuzzy Information and Engineering Volume 2. Advances in Intelligent and Soft Computing, vol 62. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03664-4_132
Download citation
DOI: https://doi.org/10.1007/978-3-642-03664-4_132
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03663-7
Online ISBN: 978-3-642-03664-4
eBook Packages: EngineeringEngineering (R0)