Homotopy Continuation Methods for Nonlinear Complementarity Problems
From MaRDI portal
Computational methods for problems pertaining to operations research and mathematical programming (90-08) 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)
Recommendations
Cited in
(60)- An interior point potential reduction method for constrained equations
- A continuation method for solving convex programming problemsviafischer reformulation
- Interior-point methods for nonlinear complementarity problems
- A General Framework of Continuation Methods for Complementarity Problems
- A pathsearch damped Newton method for computing general equilibria
- Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
- Homotopy methods for convex optimization
- Interior point algorithm for \(P_*\) nonlinear complementarity problems
- Tensor complementarity problems. II: Solution methods
- The aggregate homotopy method of nonmonotone complementarity problems
- A continuation method for tensor complementarity problems
- Existence and Limiting Behavior of a Non--Interior-Point Trajectory for Nonlinear Complementarity Problems Without Strict Feasibility Condition
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- Time-stepping for three-dimensional rigid body dynamics
- The feasibility of homotopy continuation method for a nonlinear matrix equation
- A full-step interior-point algorithm for linear complementarity problem based on a simple function
- On a special class of regularized central paths for semidefinite programs
- A new smoothing method for solving nonlinear complementarity problems
- A new path-following algorithm for nonlinear P_* complementarity problems
- Properties of a homotopy solution path for complementarity problems with quasi-monotone mappings.
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- The numerical study of a regularized smoothing Newton method for solving \(P_{0}\)-NCP based on the generalized smoothing Fischer-Burmeister function
- Continuous Homotopies for the Linear Complementarity Problem
- A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function
- A new class of smoothing functions and a smoothing Newton method for complementarity problems
- Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
- An interior point parameterized central path following algorithm for linearly constrained convex programming
- The asymptotic Browder Hartman Stampacchia condition and interior bands of \(\varepsilon\)-solutions for nonlinear complementarity problems
- A combined homotopy method for nonlinear complementarity problems
- Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
- A new continuation method for complementarity problems with uniform P- functions
- A globally convergent primal-dual interior point algorithm for convex programming
- A quadratically convergent scaling newton’s method for nonlinear programming problems
- On total functions, existence theorems and computational complexity
- An infeasible interior-point method with improved centering steps for monotone linear complementarity problems
- An extension of the potential reduction algorithm for linear complementarity problems with some priority goals
- Homotopy method of the generalized horizontal complementarity problems
- A geometrical interpretation of the without-exception feasibility of PL homotopy methods
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- A PL homotopy continuation method with the use of an odd map for the artificial level
- A primal-dual infeasible-interior-point algorithm for linear programming
- Strict feasibility conditions in nonlinear complementarity problems
- A globally convergent non-interior point homotopy method for solving variational inequalities
- A note on a potential reduction algorithm for LP with simultaneous primal-dual updating
- scientific article; zbMATH DE number 6129976 (Why is no real title available?)
- A continuation method for monotone variational inequalities
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- A family of new smoothing functions and~a~nonmonotone smoothing Newton method for the nonlinear complementarity problems
- Sufficient conditions on nonemptiness and boundedness of the solution set of the \(P_{0}\) function nonlinear complementarity problem
- A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems*
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- A quadratically convergent scaling newton’s method for nonlinear complementarity problems
- On a new homotopy continuation trajectory for nonlinear complementary problems.
- A new homotopy method for solving non-linear complementarity problems
- Global convergence in infeasible-interior-point algorithms
- Analysis for a homotopy path of complementarity problems based on \(\mu\)-exceptional family
- Strict feasibility of variational inequalities in reflexive Banach spaces
- A new approach to continuation methods for complementarity problems with uniform P-functions
This page was built for publication: Homotopy Continuation Methods for Nonlinear Complementarity Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3989816)
