Pages that link to "Item:Q3989816"
From MaRDI portal
The following pages link to Homotopy Continuation Methods for Nonlinear Complementarity Problems (Q3989816):
Displaying 50 items.
- The numerical study of a regularized smoothing Newton method for solving \(P_{0}\)-NCP based on the generalized smoothing Fischer-Burmeister function (Q434689) (← links)
- A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function (Q451811) (← links)
- Interior point algorithm for \(P_*\) nonlinear complementarity problems (Q544204) (← links)
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems (Q611277) (← links)
- A geometrical interpretation of the without-exception feasibility of PL homotopy methods (Q750942) (← links)
- On total functions, existence theorems and computational complexity (Q808245) (← links)
- On a special class of regularized central paths for semidefinite programs (Q847845) (← links)
- A new path-following algorithm for nonlinear \(P_*\) complementarity problems (Q853548) (← links)
- Strict feasibility of variational inequalities in reflexive Banach spaces (Q884934) (← links)
- A new continuation method for complementarity problems with uniform P- functions (Q1121180) (← links)
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems (Q1176569) (← links)
- A unified approach to interior point algorithms for linear complementarity problems: A summary (Q1180826) (← links)
- A note on a potential reduction algorithm for LP with simultaneous primal-dual updating (Q1186945) (← links)
- A homotopy continuation method for solving normal equations (Q1290623) (← links)
- Existence and limiting behavior of trajectories associated with \({\mathbf P}_0\)-equations (Q1294815) (← links)
- A primal-dual infeasible-interior-point algorithm for linear programming (Q1315419) (← links)
- An extension of the potential reduction algorithm for linear complementarity problems with some priority goals (Q1318200) (← links)
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP (Q1319022) (← links)
- A globally convergent primal-dual interior point algorithm for convex programming (Q1330897) (← links)
- Global convergence in infeasible-interior-point algorithms (Q1334952) (← links)
- A new approach to continuation methods for complementarity problems with uniform \(P\)-functions (Q1376327) (← links)
- Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function (Q1411490) (← links)
- Properties of a homotopy solution path for complementarity problems with quasi-monotone mappings. (Q1415265) (← links)
- A continuation method for tensor complementarity problems (Q1730781) (← links)
- An interior point potential reduction method for constrained equations (Q1814789) (← links)
- Strict feasibility conditions in nonlinear complementarity problems (Q1841578) (← links)
- Sufficient conditions on nonemptiness and boundedness of the solution set of the \(P_{0}\) function nonlinear complementarity problem (Q1866988) (← links)
- A continuation method for monotone variational inequalities (Q1908015) (← links)
- On the formulation and theory of the Newton interior-point method for nonlinear programming (Q1918017) (← links)
- Interior-point methods for nonlinear complementarity problems (Q1918290) (← links)
- A new class of smoothing functions and a smoothing Newton method for complementarity problems (Q1941192) (← links)
- Time-stepping for three-dimensional rigid body dynamics (Q1972928) (← links)
- An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635) (← links)
- A family of new smoothing functions and~a~nonmonotone smoothing Newton method for the nonlinear complementarity problems (Q2251761) (← links)
- Tensor complementarity problems. II: Solution methods (Q2275317) (← links)
- A new smoothing method for solving nonlinear complementarity problems (Q2329997) (← links)
- A pathsearch damped Newton method for computing general equilibria (Q2365112) (← links)
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (Q2366605) (← links)
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming (Q2368076) (← links)
- The asymptotic Browder Hartman Stampacchia condition and interior bands of \(\varepsilon\)-solutions for nonlinear complementarity problems (Q2478062) (← links)
- Analysis for a homotopy path of complementarity problems based on \(\mu\)-exceptional family (Q2572367) (← links)
- A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems<sup>*</sup> (Q2709447) (← links)
- On a new homotopy continuation trajectory for nonlinear complementary problems. (Q2757673) (← links)
- A full-step interior-point algorithm for linear complementarity problem based on a simple function (Q2903245) (← links)
- A globally convergent non-interior point homotopy method for solving variational inequalities (Q3096888) (← links)
- Homotopy method of the generalized horizontal complementarity problems (Q3193741) (← links)
- An infeasible interior-point method with improved centering steps for monotone linear complementarity problems (Q3452701) (← links)
- Continuous Homotopies for the Linear Complementarity Problem (Q3827483) (← links)
- A General Framework of Continuation Methods for Complementarity Problems (Q4286943) (← links)
- Existence and Limiting Behavior of a Non--Interior-Point Trajectory for Nonlinear Complementarity Problems Without Strict Feasibility Condition (Q4537770) (← links)
