Pages that link to "Item:Q4441944"

The following pages link to A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P₀LCPs (Q4441944):

Displaying 18 items.

• On solving linear complementarity problems by DC programming and DCA (Q409266) (← 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)
• A predictor-corrector smoothing Newton method for symmetric cone complementarity problems (Q613219) (← links)
• Finite termination of a Newton-type algorithm based on a new class of smoothing functions for the affine variational inequality problem (Q670858) (← links)
• A smoothing Newton method with a mixed line search for monotone weighted complementarity problems (Q782310) (← links)
• Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem (Q942413) (← links)
• Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem (Q1021504) (← links)
• Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search (Q1041534) (← links)
• A note on quadratic convergence of a smoothing Newton algorithm for the LCP (Q1941195) (← links)
• A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems (Q2249820) (← links)
• An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
• Global and global linear convergence of smoothing algorithm for the Cartesian \(P_*(\kappa)\)-SCLCP (Q2358845) (← links)
• An entire space polynomial-time algorithm for linear programming (Q2442633) (← links)
• Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem (Q2496370) (← links)
• A globally convergent non-interior point homotopy method for solving variational inequalities (Q3096888) (← links)
• A high-order path-following method for projection onto the primal-dual optimal solution set of linear programs (Q3648621) (← links)
• A continuation method for linear complementarity problems with<i>P</i>₀matrix (Q5169455) (← links)
• A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution (Q5481687) (← links)