A new continuation method for complementarity problems with uniform P- functions
From MaRDI portal
Publication:1121180
DOI10.1007/BF01582283zbMath0673.90084OpenAlexW2038872086MaRDI QIDQ1121180
Toshihito Noma, Shinji Mizuno, Kojima, Masakazu
Publication date: 1989
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582283
Related Items
A pathsearch damped Newton method for computing general equilibria, A polynomial-time algorithm for affine variational inequalities, A Newton-type method for positive-semidefinite linear complementarity problems, A continuation method for monotone variational inequalities, Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems, A new approach to continuation methods for complementarity problems with uniform \(P\)-functions, Interior-point methods for nonlinear complementarity problems, A quadratically convergent scaling newton’s method for nonlinear complementarity problems, The numerical study of a regularized smoothing Newton method for solving \(P_{0}\)-NCP based on the generalized smoothing Fischer-Burmeister function, A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems*, A continuation method for tensor complementarity problems, An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming, Tensor complementarity problems. II: Solution methods, Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach, On the convergence of the method of analytic centers when applied to convex quadratic programs, Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems., Functions without exceptional family of elements and complementarity problems, Solution differentiability and continuation of Newton's method for variational inequality problems over polyhedral sets, A continuation method for (strongly) monotone variational inequalities, Strict feasibility conditions in nonlinear complementarity problems, A new homotopy method for solving non-linear complementarity problems, Interior-point algorithms for global optimization, Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications, Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial-time algorithm for a class of linear complementarity problems
- An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
- Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
- Classes of functions and feasibility conditions in nonlinear complementarity problems
- A unification of the existence theorems of the nonlinear complementarity problem
- Bimatrix Equilibrium Points and Mathematical Programming
- Nonlinear Programs with Positively Bounded Jacobians
- The Linear Complementarity Problem