Generalized Descent Methods for Asymmetric Systems of Equations

We consider generalizations of the steepest descent algorithm for solving asymmetric systems of equations. We first show that if the system is linear and is defined by the matrix M, then the method converges if M2 is positive definite. We also establish easy to verify conditions on the matrix M that ensure that M2 is positive definite, and develop a scaling procedure that extends the class of matrices that satisfy the convergence conditions. In addition, we establish a local convergence result for nonlinear systems defined by uniformly monotone maps, and discuss a class of general descent methods. All of the methods that we consider reduce to standard nonlinear programming algorithms for equivalent optimization problems when the Jacobian of the underlying problem map is symmetric. We interpret the convergence conditions for the generalized steepest descent algorithms as restricting the degree of asymmetry of the problem map.

[1]  Charles R. Johnson,et al.  Accretive matrix products , 1975 .

[2]  M. Florian,et al.  The convergence of diagonalization algorithms for asymmetric network equilibrium problems , 1982 .

[3]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .

[4]  J. Hammond.  Solving asymmetric variational inequality problems and systems of equations with generalized nonlinear programming algorithms , 1984 .

[5]  Patrice Marcotte.  A New Algorithm for Solving Variational Inequalities Over Polyhedra with Application to the Trafic Assignment Problem , 1983 .

[6]  William W. Hogan,et al.  On Convergence of the PIES Algorithm for Computing Equilibria , 1982, Oper. Res..

[7]  L. Shapley.  SOME TOPICS IN TWO-PERSON GAMES , 1963 .

[8]  R. Courant.  Variational methods for the solution of problems of equilibrium and vibrations , 1943 .

[9]  Stella Dafermos,et al.  An iterative scheme for variational inequalities , 1983, Math. Program..

[10]  H. B. Curry.  The method of steepest descent for non-linear minimization problems , 1944 .

[11]  Fernando Sanford,et al.  Elements of Physics , 2010, Nature.

[12]  J. Robinson.  AN ITERATIVE METHOD OF SOLVING A GAME , 1951, Classics in Game Theory.

[13]  A. Auslender.  Optimisation : méthodes numériques , 1976 .

[14]  Warrren B Powell,et al.  The Convergence of Equilibrium Algorithms with Predetermined Step Sizes , 1982 .

[15]  E. Polak.  Introduction to linear and nonlinear programming , 1973 .

[16]  Larry J. LeBlanc,et al.  AN EFFICIENT APPROACH TO SOLVING THE ROAD NETWORK EQUILIBRIUM TRAFFIC ASSIGNMENT PROBLEM. IN: THE AUTOMOBILE , 1975 .

[17]  H HammondJanice,et al.  Generalized Descent Methods for Asymmetric Systems of Equations , 1987 .

[18]  C. B. Mcguire,et al.  Studies in the Economics of Transportation , 1958 .

[19]  D. Kinderlehrer,et al.  An introduction to variational inequalities and their applications , 1980 .

[20]  Charles Royal Johnson.  Matrices whose hermitian part is positive definite , 1972 .

[21]  D. Hearn,et al.  Simplical decomposition of the asymmetric traffic assignment problem , 1984 .

[22]  Jong-Shi Pang,et al.  Iterative methods for variational and complementarity problems , 1982, Math. Program..

[23]  Alpheus W. Smith,et al.  Elements of Physics , 2008 .

[24]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[25]  Bruce L. Golden,et al.  A minimum-cost multicommodity network flow problem concerning imports and exports , 1975, Networks.

[26]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[27]  Bela Martos,et al.  Nonlinear programming theory and methods , 1977 .

[28]  Elijah Polak,et al.  Computational methods in optimization , 1971 .

[29]  M. Hestenes,et al.  Methods of conjugate gradients for solving linear systems , 1952 .