zbMATH — the first resource for mathematics

A superlinearly convergent projection method for constrained systems of nonlinear equations. (English) Zbl 1191.90072
Summary: A new projection method for solving a system of nonlinear equations with convex constraints is presented. Compared with the existing projection method for solving the problem, the projection region in this new algorithm is modified which makes an optimal stepsize available at each iteration and hence guarantees that the next iterate is more closer to the solution set. Under mild conditions, we show that the method is globally convergent, and if an error bound assumption holds in addition, it is shown to be superlinearly convergent. Preliminary numerical experiments also show that this method is more efficient and promising than the existing projection method.

90C30 Nonlinear programming
15A06 Linear equations (linear algebraic aspects)
levmar; MCPLIB
Full Text: DOI
[1] Calamai P.H., MorĂ© J.J.: Projected gradient methods for linearly constrained problems. Math. Program. 39(1), 93–116 (1987) · Zbl 0634.90064
[2] Dirkse S.P., Ferris M.C.: MCPLIB: a collection of nonlinear mixed complementarity problems. Optim. Methods Software 5, 319–345 (1995)
[3] El-Hawary M.E.: Optimal Power Flow: Solution Techniques, Requirement and Challenges. IEEE Service Center, Piscataway, NJ (1996)
[4] Kanzow C., Yamashita N., Fukushima M.: Levenberg-Marquardt methods for constrained nonlinear equations with strong local convergence properties. J. Comput. Appl. Math. 172, 375–397 (2004) · Zbl 1064.65037
[5] Maranas C.D., Floudas C.A.: Finding all solutions of nonlinearly constrained systems of equations. J. Glob. Optim. 7(2), 143–182 (1995) · Zbl 0841.90115
[6] Meintjes K., Morgan A.P.: A methodology for solving chemical equilibrium systems. Appl. Math. Comput. 22, 333–361 (1987) · Zbl 0616.65057
[7] Solodov M.V., Svaiter B.F.: A new projection method for variational inequality problems. SIAM J. Control Optim. 37(3), 765–776 (1999) · Zbl 0959.49007
[8] Solodov M.V., Svaiter B.F.: A truly globally convergent Newton-type method for the monotone nonlinear complementarity problem. SIAM J. Optim. 10, 605–625 (2000) · Zbl 0955.90133
[9] Tong X.J., Qi L.: On the convergence of a trust-region method for solving constrained nonlinear equations with degenerate solution. J. Optim. Theory Appl. 123, 187–211 (2004) · Zbl 1069.65055
[10] Wang Y.J., Xiu N.H., Zhang J.Z.: Unified framework of extragradient-type methods for pseudomonotone variational inequalities. J. Optim. Theory Appl. 111, 641–656 (2001) · Zbl 1039.49014
[11] Wang C.W., Wang Y.J., Xu C.L.: A projection method for a system of nonlinear equtions with convex constraints. Math. Methods Oper. Res. 66, 33–46 (2007) · Zbl 1126.90067
[12] Wood A.J., Wollenberg B.F.: Power Generations, Operations, and Control. Wiley, New York (1996)
[13] Xiu N.H., Zhang J.Z.: Some recent advances in projection-type methods for variational inequalities. J. Comput. Appl. Math. 152, 559–585 (2003) · Zbl 1018.65083
[14] Xiu N.H., Wang C.Y., Zhang J.Z.: Convergence properties of projection and contraction methods for variational inequality problems. Appl. Math. Optim. 43, 147–168 (2001) · Zbl 0980.90093
[15] Yamashita N., Fukushima M.: On the rate of convergence of the Levenberg-Marquardt method. Computing (Suppl.) 15, 237–249 (2001) · Zbl 1001.65047
[16] Zarantonello E.H.: Projections on convex sets in Hilbert space and spectral theory, contributions to nonlinear functional analysis. In: Zarantonello, E.H. (eds) Contributions to Nonlinear Functional Analysis, Academic Press, New York, NY (1971)
[17] Zhou G.L., Toh K.C.: Superlinear convergence of a Newton-type algorithm for monotone equations. J. Optim. Theory Appl. 125, 205–221 (2005) · Zbl 1114.65055
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.