Pages that link to "Item:Q1575072"

The following pages link to The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform \(P\)-functions (Q1575072):

Displaying 24 items.

• A modified feasible semi-smooth asymptotically Newton method for nonlinear complementarity problems (Q311331) (← links)
• A feasible directions algorithm for nonlinear complementarity problems and applications in mechanics (Q381248) (← links)
• The numerical study of a regularized smoothing Newton method for solving \(P_{0}\)-NCP based on the generalized smoothing Fischer-Burmeister function (Q434689) (← links)
• Superlinear/quadratic smoothing Broyden-like method for the generalized nonlinear complementarity problem (Q619752) (← links)
• A new smoothing Broyden-like method for solving nonlinear complementarity problem with a \(P_{0}\)-function (Q652695) (← links)
• Inexact non-interior continuation method for monotone semidefinite complementarity problems (Q694179) (← links)
• A new smoothing and regularization Newton method for \(P_{0}\)-NCP (Q708899) (← links)
• Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems (Q732492) (← links)
• A global linear and local superlinear (quadratic) inexact non-interior continuation method for variational inequalities over general closed convex sets (Q829878) (← links)
• A new path-following algorithm for nonlinear \(P_*\) complementarity problems (Q853548) (← links)
• Some non-interior path-following methods based on a scaled central path for linear complementarity problems (Q969724) (← links)
• A globally convergent interior point algorithm for non-convex nonlinear programming (Q1002202) (← links)
• Inexact non-interior continuation method for solving large-scale monotone SDCP (Q1044421) (← 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)
• A regularized smoothing Newton method for solving SOCCPs based on a new smoothing C-function (Q1644067) (← links)
• Nonsmooth Levenberg-Marquardt type method for solving a class of stochastic linear complementarity problems with finitely many elements (Q1736870) (← links)
• On the rate of local convergence of high-order-infeasible-path-following algorithms for \(P_*\)-linear complementarity problems (Q1819152) (← links)
• An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
• A modified Broyden-like method for nonlinear complementarity problems (Q2379896) (← links)
• A polynomial path following algorithm for convex programming (Q2479155) (← links)
• The global linear convergence of a noninterior path-following algorithm for linear complementarity problems (Q2757562) (← links)
• NON-INTERIOR CONTINUATION METHOD FOR COMPLEMENTARITY PROBLEMS IN ABSENCE OF STRICT COMPLEMENTARITY (Q3379507) (← links)
• (Q3428948) (← links)
• Complexity of a noninterior path-following method for the linear complementarity problem (Q5959900) (← links)