Homotopy Continuation Methods for Nonlinear Complementarity Problems

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

Toshihito Noma, Nimrod Megiddo, Kojima, Masakazu

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 convergencehomotopy continuation methods\(P_ 0\)-function

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

A globally convergent primal-dual interior point algorithm for convex programming, A pathsearch damped Newton method for computing general equilibria, Global convergence in infeasible-interior-point algorithms, 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, A full-step interior-point algorithm for linear complementarity problem based on a simple function, An infeasible interior-point method with improved centering steps for monotone linear complementarity problems, On a special class of regularized central paths for semidefinite programs, A new path-following algorithm for nonlinear \(P_*\) complementarity problems, A continuation method for monotone variational inequalities, A new approach to continuation methods for complementarity problems with uniform \(P\)-functions, On the formulation and theory of the Newton interior-point method for nonlinear programming, Interior-point methods for nonlinear complementarity problems, A quadratically convergent scaling newton’s method for nonlinear complementarity problems, A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems, Strict feasibility of variational inequalities in reflexive Banach spaces, A new class of smoothing functions and a smoothing Newton method for complementarity problems, Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function, The numerical study of a regularized smoothing Newton method for solving \(P_{0}\)-NCP based on the generalized smoothing Fischer-Burmeister function, Properties of a homotopy solution path for complementarity problems with quasi-monotone mappings., A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function, A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems^*, An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems, A continuation method for tensor complementarity problems, Time-stepping for three-dimensional rigid body dynamics, 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 family of new smoothing functions and~a~nonmonotone smoothing Newton method for the nonlinear complementarity problems, The asymptotic Browder Hartman Stampacchia condition and interior bands of \(\varepsilon\)-solutions for nonlinear complementarity problems, Interior point algorithm for \(P_*\) nonlinear complementarity problems, Tensor complementarity problems. II: Solution methods, A quadratically convergent scaling newton’s method for nonlinear programming problems, A continuation method for solving convex programming problemsviafischer reformulation, Improving the convergence of non-interior point algorithms for nonlinear complementarity problems, An interior point potential reduction method for constrained equations, A globally convergent non-interior point homotopy method for solving variational inequalities, A new smoothing method for solving nonlinear complementarity problems, Strict feasibility conditions in nonlinear complementarity problems, A new homotopy method for solving non-linear complementarity problems, Analysis for a homotopy path of complementarity problems based on \(\mu\)-exceptional family, A primal-dual infeasible-interior-point algorithm for linear programming, On total functions, existence theorems and computational complexity, 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, An interior point parameterized central path following algorithm for linearly constrained convex programming, Sufficient conditions on nonemptiness and boundedness of the solution set of the \(P_{0}\) function nonlinear complementarity problem