Homotopy Continuation Methods for Nonlinear Complementarity Problems

DOI10.1287/moor.16.4.754zbMath0744.90087MaRDI QIDQ3989816

Kojima, Masakazu, Nimrod Megiddo, Toshihito Noma

Publication date: 28 June 1992

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.1176

zbMATH Keywords

global and local convergence; homotopy continuation methods; \(P_ 0\)-function

Mathematics Subject Classification ID

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

65H20: Global methods, including homotopy approaches to the numerical solution of nonlinear equations

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

Improving the convergence of non-interior point algorithms for nonlinear complementarity problems, A quadratically convergent scaling newton’s method for nonlinear complementarity problems, A quadratically convergent scaling newton’s method for nonlinear programming problems, A continuation method for solving convex programming problemsviafischer reformulation, A new homotopy method for solving non-linear complementarity problems, On total functions, existence theorems and computational complexity, A new path-following algorithm for nonlinear \(P_*\) complementarity problems, Strict feasibility of variational inequalities in reflexive Banach spaces, An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems, A unified approach to interior point algorithms for linear complementarity problems: A summary, A note on a potential reduction algorithm for LP with simultaneous primal-dual updating, A primal-dual infeasible-interior-point algorithm for linear programming, An extension of the potential reduction algorithm for linear complementarity problems with some priority goals, On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP, A globally convergent primal-dual interior point algorithm for convex programming, Global convergence in infeasible-interior-point algorithms, A new approach to continuation methods for complementarity problems with uniform \(P\)-functions, Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function, Properties of a homotopy solution path for complementarity problems with quasi-monotone mappings., An interior point potential reduction method for constrained equations, Strict feasibility conditions in nonlinear complementarity problems, Sufficient conditions on nonemptiness and boundedness of the solution set of the \(P_{0}\) function nonlinear complementarity problem, A continuation method for monotone variational inequalities, On the formulation and theory of the Newton interior-point method for nonlinear programming, Interior-point methods for nonlinear complementarity problems, Time-stepping for three-dimensional rigid body dynamics, A pathsearch damped Newton method for computing general equilibria, Theoretical convergence of large-step primal-dual interior point algorithms for linear programming, A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming, The asymptotic Browder Hartman Stampacchia condition and interior bands of \(\varepsilon\)-solutions for nonlinear complementarity problems, Analysis for a homotopy path of complementarity problems based on \(\mu\)-exceptional family, A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems^*