tel-00703797, version 2 - 7 Jun 2012 Chapitre 3. Calcul d’équilibre <strong>de</strong> Nash généralisé 3.5.2 Numerical results Fct. call Jac. call Time x ⋆ 1 x ⋆ 2 λ ⋆ 1 λ ⋆ 1 ||F (z ⋆ )|| Co<strong>de</strong> Newton - GLS 14 6 0.003 71 5 Newton - QLS 9 6 0.003 71 6 Newton - PTR 38 17 0.005 2 -2 1e-25 160 1.4e-11 1 Newton - DTR 34 16 0.052 2 -2 -3.4e-29 160 4.7e-29 1 Broy<strong>de</strong>n - GLS 1866 4 0.079 1 4.1e-18 512 6 7e-13 1 Broy<strong>de</strong>n - QLS 93 4 0.005 71 5 Broy<strong>de</strong>n - PTR 21 2 0.002 1 -7.6e-15 512 6 1.3e-11 1 Broy<strong>de</strong>n - DTR 21 2 0.003 1 -4.6e-15 512 6 2.3e-12 1 LM min - GLS 33 33 0.023 4.9e-07 3 LM adaptive 18 9 0.006 -2 3 8 -3.9e-14 3.3e-11 1 Mod. CE Newton 1782 158 0.295 2500 6 Bibliography Table 3.4: Results with starting point (5, 5, 0, 0) and φ∧ Allgower, E. L. and Georg, K. (2003), Introduction to Numerical Continuation Methods, SIAM. 146 Bazaraa, M. S., Sherali, H. D. and Shetty, C. M. (2006), Nonlinear Programming: Theory and Algorithms, Wiley interscience. 139 Bonnans, J. F., Gilbert, J. C., Lemaréchal, C. and Sagastizábal, C. A. (2006), Numerical Optimization: Theoretical and Practical Aspects, Second edition, Springer-Verlag. 143, 147 Broy<strong>de</strong>n, C. G. (1965), ‘A class of methods for solving <strong>non</strong>linear simultaneous equations’, Mathematics of Computation 19(92), 577–593. 145, 146 Clarke, F. H. (1975), ‘Generalized gradients and applications’, Transactions of the American Mathematical Society 205(1), 247–262. 151 Clarke, F. H. (1990), Optimization and Nonsmooth Analysis, SIAM. 151, 152, 165 Clarke, F. H. and Bessis, D. N. (1999), ‘Partial subdifferentials, <strong>de</strong>rivates and Ra<strong>de</strong>macher’s theorem’, Transactions of the American Mathematical Society 351(7), 2899–2926. 165 Dennis, J. E. and Morée, J. J. (1977), ‘Quasi-newton methods, motivation and theory’, SIAM Re<strong>vie</strong>w 19(1). 146 Dennis, J. E. and Schnabel, R. B. (1996), Numerical Methods for Unconstrained Optimization and Nonlinear Equations, SIAM. 143, 146, 147, 149, 155, 163 Dreves, A., Facchinei, F., Kanzow, C. and Sagratella, S. (2011), ‘On the solutions of the KKT conditions of generalized Nash equilibrium problems’, SIAM Journal on Optimization 21(3), 1082–1108. 139, 140, 159, 160, 162, 164 166
tel-00703797, version 2 - 7 Jun 2012 BIBLIOGRAPHY Facchinei, F., Fischer, A. and Piccialli, V. (2007), ‘On generalized Nash games and variational inequalities’, Operations Research Letters 35(2), 159–164. 142 Facchinei, F., Fischer, A. and Piccialli, V. (2009), ‘Generalized Nash equilibrium problems and Newton methods’, Math. Program., Ser. B 117(1-2), 163–194. 139, 155, 156 Facchinei, F. and Kanzow, C. (1997), ‘A <strong>non</strong>smooth inexact Newton method for the solution of large-scale <strong>non</strong>linear complementarity problems’, Mathematical Programming 76(3), 493– 512. 156 Facchinei, F. and Kanzow, C. (2009), Generalized Nash equilibrium problems. Updated version of the ’quaterly journal of operations research’ version. 138, 139, 140, 141, 142 Facchinei, F. and Pang, J.-S. (2003), Finite-Dimensional Variational Inequalities and Complementary Problems. Volume II, Springer-Verlag New York, Inc. 139, 146, 152, 154, 159 Fan, J.-Y. (2003), ‘A modified Levenberg-Marquardt algorithm for singular system of <strong>non</strong>linear equations’, Journal of Computational Mathematics 21(5), 625–636. 150 Fan, J.-Y. and Yuan, Y.-X. (2005), ‘On the quadratic convergence of the Levenberg-Marquardt Method without <strong>non</strong>singularity assumption’, Computing 74(1), 23–39. 146, 150 Fischer, A. (2002), ‘Local behavior of an iterative framework for generalized equations with <strong>non</strong>isolated solutions’, Math. Program., Ser. A 94(1), 91–124. 150 Fukushima, M. and Pang, J.-S. (2005), ‘Quasi-variational inequalities, generalized Nash equilibria, and multi-lea<strong>de</strong>r-follower games’, Comput. Manag. Sci. 2, 21–56. 141 Fukushima, M. and Qi, L., eds (1999), Reformulation - Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, Kluwer Aca<strong>de</strong>mic Publishers. 139 Ip, C. and Kyparisis, J. (1992), ‘Local convergence of quasi-Newton methods for Bdifferentiable equations’, Mathematical Programming 56(1-3), 71–89. 155, 157 Jeyakumar, V. (1998), Simple Characterizations of Superlinear Convergence for Semismooth Equations via Approximate Jacobians, Technical report, School of Mathematics, University of New South Wales. 155 Jiang, H. (1999), ‘Global convergence analysis of the generalized Newton and Gauss-Newton methods for the Fischer-Burmeister equation for the complementarity problem’, Mathematics of Operations Research 24(3), 529–543. 158 Jiang, H., Fukushima, M., Qi, L. and Sun, D. (1998), ‘A Trust Region Method for Solving Generalized Complementarity Problem’, SIAM Journal on Optimization 8(1). 158 Jiang, H., Qi, L., Chen, X. and Sun, D. (1996), Semismoothness and superlinear convergence in <strong>non</strong>smooth optimization and <strong>non</strong>smooth equations, in ‘Nonlinear Optimization and Applications’, Plenum Press. 157 Jiang, H. and Ralph, D. (1998), Global and local superlinear convergence analysis of Newtontype methods for semismooth equations with smooth least squares, in M. Fukushima and L. Qi, eds, ‘Reformulation - <strong>non</strong>smooth, piecewise smooth, semismooth and smoothing methods’, Boston MA: Kluwer Aca<strong>de</strong>mic Publishers. 155, 158 167
- Page 1 and 2:
tel-00703797, version 2 - 7 Jun 201
- Page 3 and 4:
tel-00703797, version 2 - 7 Jun 201
- Page 5 and 6:
tel-00703797, version 2 - 7 Jun 201
- Page 7 and 8:
tel-00703797, version 2 - 7 Jun 201
- Page 9 and 10:
tel-00703797, version 2 - 7 Jun 201
- Page 11 and 12:
tel-00703797, version 2 - 7 Jun 201
- Page 13 and 14:
tel-00703797, version 2 - 7 Jun 201
- Page 15 and 16:
tel-00703797, version 2 - 7 Jun 201
- Page 17 and 18:
tel-00703797, version 2 - 7 Jun 201
- Page 19 and 20:
tel-00703797, version 2 - 7 Jun 201
- Page 21 and 22:
tel-00703797, version 2 - 7 Jun 201
- Page 23 and 24:
tel-00703797, version 2 - 7 Jun 201
- Page 25 and 26:
tel-00703797, version 2 - 7 Jun 201
- Page 27 and 28:
tel-00703797, version 2 - 7 Jun 201
- Page 29 and 30:
tel-00703797, version 2 - 7 Jun 201
- Page 31 and 32:
tel-00703797, version 2 - 7 Jun 201
- Page 33 and 34:
tel-00703797, version 2 - 7 Jun 201
- Page 35 and 36:
tel-00703797, version 2 - 7 Jun 201
- Page 37 and 38:
tel-00703797, version 2 - 7 Jun 201
- Page 39 and 40:
tel-00703797, version 2 - 7 Jun 201
- Page 41 and 42:
tel-00703797, version 2 - 7 Jun 201
- Page 43 and 44:
tel-00703797, version 2 - 7 Jun 201
- Page 45 and 46:
tel-00703797, version 2 - 7 Jun 201
- Page 47 and 48:
tel-00703797, version 2 - 7 Jun 201
- Page 49 and 50:
tel-00703797, version 2 - 7 Jun 201
- Page 51 and 52:
tel-00703797, version 2 - 7 Jun 201
- Page 53 and 54:
tel-00703797, version 2 - 7 Jun 201
- Page 55 and 56:
tel-00703797, version 2 - 7 Jun 201
- Page 57 and 58:
tel-00703797, version 2 - 7 Jun 201
- Page 59 and 60:
tel-00703797, version 2 - 7 Jun 201
- Page 61 and 62:
tel-00703797, version 2 - 7 Jun 201
- Page 63 and 64:
tel-00703797, version 2 - 7 Jun 201
- Page 65 and 66:
tel-00703797, version 2 - 7 Jun 201
- Page 67 and 68:
tel-00703797, version 2 - 7 Jun 201
- Page 69 and 70:
tel-00703797, version 2 - 7 Jun 201
- Page 71 and 72:
tel-00703797, version 2 - 7 Jun 201
- Page 73 and 74:
tel-00703797, version 2 - 7 Jun 201
- Page 75 and 76:
tel-00703797, version 2 - 7 Jun 201
- Page 77 and 78:
tel-00703797, version 2 - 7 Jun 201
- Page 79 and 80:
tel-00703797, version 2 - 7 Jun 201
- Page 81 and 82:
tel-00703797, version 2 - 7 Jun 201
- Page 83 and 84:
tel-00703797, version 2 - 7 Jun 201
- Page 85 and 86:
tel-00703797, version 2 - 7 Jun 201
- Page 87 and 88:
tel-00703797, version 2 - 7 Jun 201
- Page 89 and 90:
tel-00703797, version 2 - 7 Jun 201
- Page 91 and 92:
tel-00703797, version 2 - 7 Jun 201
- Page 93 and 94:
tel-00703797, version 2 - 7 Jun 201
- Page 95 and 96:
tel-00703797, version 2 - 7 Jun 201
- Page 97 and 98:
tel-00703797, version 2 - 7 Jun 201
- Page 99 and 100:
tel-00703797, version 2 - 7 Jun 201
- Page 101 and 102:
tel-00703797, version 2 - 7 Jun 201
- Page 103 and 104:
tel-00703797, version 2 - 7 Jun 201
- Page 105 and 106:
tel-00703797, version 2 - 7 Jun 201
- Page 107 and 108:
tel-00703797, version 2 - 7 Jun 201
- Page 109 and 110:
tel-00703797, version 2 - 7 Jun 201
- Page 111 and 112:
tel-00703797, version 2 - 7 Jun 201
- Page 113 and 114:
tel-00703797, version 2 - 7 Jun 201
- Page 115 and 116:
tel-00703797, version 2 - 7 Jun 201
- Page 117 and 118:
tel-00703797, version 2 - 7 Jun 201
- Page 119 and 120:
tel-00703797, version 2 - 7 Jun 201
- Page 121 and 122:
tel-00703797, version 2 - 7 Jun 201
- Page 123 and 124:
tel-00703797, version 2 - 7 Jun 201
- Page 125 and 126:
tel-00703797, version 2 - 7 Jun 201
- Page 127 and 128:
tel-00703797, version 2 - 7 Jun 201
- Page 129 and 130: tel-00703797, version 2 - 7 Jun 201
- Page 131 and 132: tel-00703797, version 2 - 7 Jun 201
- Page 133 and 134: tel-00703797, version 2 - 7 Jun 201
- Page 135 and 136: tel-00703797, version 2 - 7 Jun 201
- Page 137 and 138: tel-00703797, version 2 - 7 Jun 201
- Page 139 and 140: tel-00703797, version 2 - 7 Jun 201
- Page 141 and 142: tel-00703797, version 2 - 7 Jun 201
- Page 143 and 144: tel-00703797, version 2 - 7 Jun 201
- Page 145 and 146: tel-00703797, version 2 - 7 Jun 201
- Page 147 and 148: tel-00703797, version 2 - 7 Jun 201
- Page 149 and 150: tel-00703797, version 2 - 7 Jun 201
- Page 151 and 152: tel-00703797, version 2 - 7 Jun 201
- Page 153 and 154: tel-00703797, version 2 - 7 Jun 201
- Page 155 and 156: tel-00703797, version 2 - 7 Jun 201
- Page 157 and 158: tel-00703797, version 2 - 7 Jun 201
- Page 159 and 160: tel-00703797, version 2 - 7 Jun 201
- Page 161 and 162: tel-00703797, version 2 - 7 Jun 201
- Page 163 and 164: tel-00703797, version 2 - 7 Jun 201
- Page 165 and 166: tel-00703797, version 2 - 7 Jun 201
- Page 167 and 168: tel-00703797, version 2 - 7 Jun 201
- Page 169 and 170: tel-00703797, version 2 - 7 Jun 201
- Page 171 and 172: tel-00703797, version 2 - 7 Jun 201
- Page 173 and 174: tel-00703797, version 2 - 7 Jun 201
- Page 175 and 176: tel-00703797, version 2 - 7 Jun 201
- Page 177 and 178: tel-00703797, version 2 - 7 Jun 201
- Page 179: tel-00703797, version 2 - 7 Jun 201
- Page 183 and 184: tel-00703797, version 2 - 7 Jun 201
- Page 185 and 186: tel-00703797, version 2 - 7 Jun 201
- Page 187 and 188: tel-00703797, version 2 - 7 Jun 201
- Page 189 and 190: tel-00703797, version 2 - 7 Jun 201
- Page 191 and 192: tel-00703797, version 2 - 7 Jun 201
- Page 193 and 194: tel-00703797, version 2 - 7 Jun 201
- Page 195 and 196: tel-00703797, version 2 - 7 Jun 201
- Page 197 and 198: tel-00703797, version 2 - 7 Jun 201
- Page 199 and 200: tel-00703797, version 2 - 7 Jun 201
- Page 201 and 202: tel-00703797, version 2 - 7 Jun 201
- Page 203 and 204: tel-00703797, version 2 - 7 Jun 201
- Page 205 and 206: tel-00703797, version 2 - 7 Jun 201
- Page 207 and 208: tel-00703797, version 2 - 7 Jun 201
- Page 209 and 210: tel-00703797, version 2 - 7 Jun 201
- Page 211 and 212: tel-00703797, version 2 - 7 Jun 201
- Page 213 and 214: tel-00703797, version 2 - 7 Jun 201
- Page 215 and 216: tel-00703797, version 2 - 7 Jun 201
- Page 217 and 218: tel-00703797, version 2 - 7 Jun 201
- Page 219 and 220: tel-00703797, version 2 - 7 Jun 201
- Page 221 and 222: tel-00703797, version 2 - 7 Jun 201
- Page 223 and 224: tel-00703797, version 2 - 7 Jun 201
- Page 225 and 226: tel-00703797, version 2 - 7 Jun 201
- Page 227 and 228: tel-00703797, version 2 - 7 Jun 201
- Page 229 and 230: tel-00703797, version 2 - 7 Jun 201
- Page 231 and 232:
tel-00703797, version 2 - 7 Jun 201
- Page 233 and 234:
tel-00703797, version 2 - 7 Jun 201
- Page 235 and 236:
tel-00703797, version 2 - 7 Jun 201
- Page 237 and 238:
tel-00703797, version 2 - 7 Jun 201
- Page 239 and 240:
tel-00703797, version 2 - 7 Jun 201
- Page 241 and 242:
tel-00703797, version 2 - 7 Jun 201
- Page 243 and 244:
tel-00703797, version 2 - 7 Jun 201
- Page 245 and 246:
tel-00703797, version 2 - 7 Jun 201
- Page 247 and 248:
tel-00703797, version 2 - 7 Jun 201