Pages that link to "Item:Q1970299"

The following pages link to A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem (Q1970299):

Displaying 34 items.

• A smoothing Newton method for the second-order cone complementarity problem. (Q351966) (← links)
• Formulating an \(n\)-person noncooperative game as a tensor complementarity problem (Q523577) (← links)
• Convergence of a non-interior continuation algorithm for the monotone SCCP (Q601939) (← links)
• A novel non-linear approach to minimal area rectangular packing (Q610981) (← links)
• Solvability of Newton equations in smoothing-type algorithms for the SOCCP (Q629483) (← links)
• A non-interior continuation algorithm for the CP based on a generalized smoothing function (Q629488) (← links)
• Inexact non-interior continuation method for monotone semidefinite complementarity problems (Q694179) (← links)
• Predictor-corrector smoothing methods for monotone LCP (Q705035) (← links)
• A smoothing Newton method with a mixed line search for monotone weighted complementarity problems (Q782310) (← links)
• A new path-following algorithm for nonlinear \(P_*\) complementarity problems (Q853548) (← links)
• Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem (Q942413) (← links)
• Analysis of a non-interior continuation method for second-order cone programming (Q949295) (← links)
• Smoothing algorithms for complementarity problems over symmetric cones (Q967217) (← links)
• Some non-interior path-following methods based on a scaled central path for linear complementarity problems (Q969724) (← links)
• Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem (Q1021504) (← links)
• Quadratic one-step smoothing Newton method for \(P_{0}\)-LCP without strict complementarity. (Q1406258) (← 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 non-interior continuation algorithm for solving the convex feasibility problem (Q1634140) (← links)
• A nonmonotone smoothing Newton algorithm for weighted complementarity problem (Q2046534) (← links)
• An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635) (← links)
• Smoothing functions and algorithm for nonsymmetric circular cone complementarity problems. (Q2128412) (← links)
• Tensor complementarity problems. II: Solution methods (Q2275317) (← links)
• An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
• A predictor-corrector smoothing method for second-order cone programming (Q2380858) (← links)
• Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functions (Q2430462) (← links)
• An entire space polynomial-time algorithm for linear programming (Q2442633) (← links)
• The asymptotic Browder Hartman Stampacchia condition and interior bands of \(\varepsilon\)-solutions for nonlinear complementarity problems (Q2478062) (← links)
• A smoothing-type algorithm for solving linear complementarity problems with strong convergence properties (Q2480789) (← links)
• Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem (Q2496370) (← links)
• A smoothing Levenberg-Marquardt method for NCP (Q2507812) (← links)
• Improving the convergence of non-interior point algorithms for nonlinear complementarity problems (Q4700198) (← links)
• Superlinear noninterior one-step continuation method for monotone LCP in the absence of strict complementarity. (Q5929417) (← links)
• A smoothing Gauss-Newton method for the generalized HLCP (Q5936078) (← links)
• Complexity of a noninterior path-following method for the linear complementarity problem (Q5959900) (← links)