A new continuation method for complementarity problems with uniform P- functions
From MaRDI portal
This paper formulates the (nonlinear) complementarity problem relative to a continuous mapping f as a problem of solving a system of equations defined by a particular mapping F from \(R_+^{2n}\) to \(R^ n_+\times R^ n\). It is shown that when f is a uniform P-function, the mapping F is a homeomorphism of \(R_+^{2n}\) to \(R^ n_+\times R^ n\). This forms the foundation of a continuation method for tracing the solution curve of the one-parameter family of systems of equations \(F(x,y)=tF(x^ 0,y^ 0)\) from an arbitrary point \((x^ 0,y^ 0)\in R_+^{2n}\) and \(t=1\) to \(t=0\).
Recommendations
- A new approach to continuation methods for complementarity problems with uniform P-functions
- Homotopy Continuation Methods for Nonlinear Complementarity Problems
- Continuation method for nonlinear complementarity problems via normal maps
- A General Framework of Continuation Methods for Complementarity Problems
- scientific article; zbMATH DE number 2075805
Cites work
- A polynomial-time algorithm for a class of linear complementarity problems
- A unification of the existence theorems of the nonlinear complementarity problem
- An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
- Bimatrix Equilibrium Points and Mathematical Programming
- Classes of functions and feasibility conditions in nonlinear complementarity problems
- scientific article; zbMATH DE number 4164543 (Why is no real title available?)
- scientific article; zbMATH DE number 3788387 (Why is no real title available?)
- scientific article; zbMATH DE number 3284926 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3074646 (Why is no real title available?)
- Nonlinear Programs with Positively Bounded Jacobians
- Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
- The Linear Complementarity Problem
Cited in
(27)- Functions without exceptional family of elements and complementarity problems
- A continuation method for (strongly) 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
- Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity
- A continuation method for tensor complementarity problems
- Two interior-point methods for nonlinear P_*()-complementarity problems.
- Solution differentiability and continuation of Newton's method for variational inequality problems over polyhedral sets
- Strict feasibility conditions in nonlinear complementarity problems
- A Newton-type method for positive-semidefinite linear complementarity problems
- A continuation method for monotone variational inequalities
- Interior-point methods for nonlinear complementarity problems
- 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
- A pathsearch damped Newton method for computing general equilibria
- A polynomial-time algorithm for affine variational inequalities
- A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems*
- Homotopy Continuation Methods for Nonlinear Complementarity Problems
- A General Framework of Continuation Methods for 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 scaling newton’s method for nonlinear complementarity problems
- A new homotopy method for solving non-linear complementarity problems
- Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
- An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming
- Interior-point algorithms for global optimization
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
This page was built for publication: A new continuation method for complementarity problems with uniform P- functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121180)
