Pages that link to "Item:Q1915906"

The following pages link to An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence (Q1915906):

Displaying 17 items.

• A polynomial interior-point algorithm for monotone linear complementarity problems (Q353166) (← links)
• An improved predictor-corrector interior-point algorithm for linear complementarity problems with \(O(\sqrt{n}L)\)-iteration complexity (Q410785) (← links)
• A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems (Q611277) (← links)
• An adaptive infeasible interior-point algorithm for linear complementarity problems (Q743784) (← links)
• Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points (Q1361112) (← links)
• Infeasible predictor-corrector interior-point method applied to image restoration in the presence of noise (Q1573984) (← links)
• A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization (Q1660297) (← links)
• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy (Q1681807) (← links)
• Global convergence enhancement of classical linesearch interior point methods for MCPs (Q1861321) (← links)
• A superquadratic infeasible-interior-point method for linear complementarity problems (Q1918925) (← links)
• Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems (Q2376364) (← links)
• An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems (Q2399607) (← links)
• A new infeasible interior-point method based on Darvay's technique for symmetric optimization (Q2449352) (← links)
• A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function (Q2810097) (← links)
• An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity (Q3444677) (← links)
• An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step (Q4635027) (← links)
• Design of continuous-time recurrent neural networks with piecewise-linear activation function for generation of prescribed sequences of bipolar vectors (Q6057957) (← links)