Pages that link to "Item:Q3854941"

The following pages link to Computational complexity of LCPs associated with positive definite symmetric matrices (Q3854941):

Displaying 36 items.

• An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem (Q261844) (← links)
• A modified feasible semi-smooth asymptotically Newton method for nonlinear complementarity problems (Q311331) (← links)
• Some LCPs solvable in strongly polynomial time with Lemke's algorithm (Q344960) (← links)
• A feasible directions algorithm for nonlinear complementarity problems and applications in mechanics (Q381248) (← links)
• 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)
• The steepest descent gravitational method for linear programming (Q583105) (← links)
• On the number of iterations of local improvement algorithms (Q594546) (← links)
• Finite termination of a Newton-type algorithm for a class of affine variational inequality problems (Q613275) (← links)
• A new smoothing Broyden-like method for solving nonlinear complementarity problem with a \(P_{0}\)-function (Q652695) (← 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 new smoothing and regularization Newton method for \(P_{0}\)-NCP (Q708899) (← 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)
• NP-completeness of the linear complementarity problem (Q1095806) (← links)
• A polynomial-time algorithm for a class of linear complementarity problems (Q1123139) (← links)
• A mixed formulation for frictional contact problems prone to Newton like solution methods (Q1191985) (← links)
• Generalized Newton method in contact mechanics (Q1354979) (← links)
• An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function (Q1677001) (← links)
• A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones (Q1743538) (← links)
• A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem (Q2175368) (← links)
• A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems (Q2249820) (← links)
• A partially smoothing Jacobian method for nonlinear complementarity problems with \(P_0\) function (Q2345686) (← links)
• A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems (Q2422131) (← links)
• On the finite convergence of Newton-type methods for \(P_{0}\) affine variational inequalities (Q2463794) (← links)
• A non-monotone inexact regularized smoothing Newton method for solving nonlinear complementarity problems (Q2885563) (← links)
• Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's (Q3657800) (← links)
• Affirmative action algorithms (Q3725860) (← links)
• A new proof for the criss-cross method for quadratic programming (Q4327956) (← links)
• An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function (Q4606373) (← links)
• Low order polynomial bounds on the expected performance of local improvement algorithms (Q4721084) (← links)
• On the computational complexity of piecewise-linear homotopy algorithms (Q4749612) (← links)
• Infeasible path-following interior point algorithm for Cartesian <i>P</i>_*(κ) nonlinear complementarity problems over symmetric cones (Q5026485) (← links)
• (Q5061832) (← links)
• A continuation method for linear complementarity problems with<i>P</i>₀matrix (Q5169455) (← links)
• Verification for existence of solutions of linear complementarity problems (Q5929743) (← links)