zbMATH — the first resource for mathematics

A projection method for a system of nonlinear monotone equations with convex constraints. (English) Zbl 1126.90067
Summary: In this paper, we propose a projection method for solving a system of nonlinear monotone equations with convex constraints. Under standard assumptions, we show the global convergence and the linear convergence rate of the proposed algorithm. Preliminary numerical experiments show that this method is efficient and promising.

90C30 Nonlinear programming
15A06 Linear equations (linear algebraic aspects)
PDF BibTeX Cite
Full Text: DOI
[1] Bellavia S, Macconi M, Morini B (2003) An affine scaling trust-region approach to bound- constrained nonlinear systems. Appl Numer Math 44:257–280 · Zbl 1018.65067
[2] Calamai PH, MorĂ© JJ (1987) Projected gradient methods for linearly constrained problems. Math Program 39(1):93–116 · Zbl 0634.90064
[3] El-Hawary ME (1996) Optimal power flow: solution techniques, requirement and challenges. IEEE Service Center, Piscataway
[4] Gabriel SA, Pang JS (1994) A trust region method for constrained nonsmooth equations. In: Hager WW, Hearn DW, Pardalos PM (eds) Large scale optimization–state of the art. Kluwer, Dordrecht, pp 155–181
[5] Gafni EM, Bertsekas DP (1984) Two-metric projection methods for constrained optimization. SIAM J Control Optim 22(6):936–964 · Zbl 0555.90086
[6] Han DR (2003) A new hybrid generalized proximal point algorithm for variational inequality problems. J Global Optim 26:125–140 · Zbl 1044.65055
[7] Kanzow C, Yamashita N, Fukushima M (2004) Levenberg–Marquardt methods for constrained nonlinear equations with strong local convergence properties. J Comput Appl Math 172: 375–397 · Zbl 1064.65037
[8] Maranas CD, Floudas CA (1995) Finding all solutions of nonlinearly constrained systems of equations. J Global Optim 7(2):143–182 · Zbl 0841.90115
[9] Solodov MV, Svaiter BF (1998) A globally convergent inexact Newton method for systems of monotone equations. In: Fukushima M, Qi L (eds) Reformulation: piecewise smooth, semismooth and smoothing methods. Kluwer, Holanda, pp 355–369
[10] Solodov MV, Svaiter BF (1999) A new projection method for variational inequality problems. SIAM J Control Optim 37(3):765–776 · Zbl 0959.49007
[11] Tong XJ, Qi L (2004) On the convergence of a trust-region method for solving constrained nonlinear equations with degenerate solution. J Optim Theory Appl 123:187–211 · Zbl 1069.65055
[12] Wang YJ, Wang CY, Xiu NH (2002) A family of supermemory gradient projection methods for constrained optimization. Optimization 51(6):889–905 · Zbl 1145.90465
[13] Wang YJ, Xiu NH, Zhang JZ (2003) Modified extragradient method for variational inequalities and verification of solution existence. J Optim Theory Appl 119:167–183 · Zbl 1045.49017
[14] Wood AJ, Wollenberg BF (1996) Power generations, operations, and control. Wiley, New York
[15] Xiu NH, Zhang JZ (2003) Some recent advances in projection-type methods for variational inequalities. J Comput Appl Math 152(1/2):559–585 · Zbl 1018.65083
[16] Yamashita N, Fukushima M (2001) On the rate of convergence of the Levenberg–Marquardt method. Computing 15(Suppl):237–249 · Zbl 1001.65047
[17] Yamashita N, Fukushima M (1997) Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems. Math Program 76:469–491 · Zbl 0872.90102
[18] Zhou GL, Toh KC (2005) Superlinear convergence of a Newton-type algorithm for monotone equations. J Optim Theory Appl 125:205–221 · 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.