Pages that link to "Item:Q1893347"

The following pages link to Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence (Q1893347):

Displaying 21 items.

• An improved predictor-corrector interior-point algorithm for linear complementarity problems with \(O(\sqrt{n}L)\)-iteration complexity (Q410785) (← links)
• Corrector-predictor methods for sufficient linear complementarity problems (Q538303) (← links)
• A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems (Q611277) (← links)
• Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization (Q995953) (← links)
• On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP (Q1319022) (← links)
• Interior point methods for optimal control of discrete time systems (Q1321328) (← links)
• Local convergence of interior-point algorithms for degenerate monotone LCP (Q1326510) (← links)
• An infeasible-interior-point algorithm for linear complementarity problems (Q1340065) (← links)
• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy (Q1681807) (← links)
• Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem (Q1760104) (← links)
• The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path (Q1848380) (← links)
• The curvature integral and the complexity of linear complementarity problems (Q1904662) (← links)
• A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem (Q1906276) (← links)
• An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence (Q1915906) (← links)
• A superquadratic infeasible-interior-point method for linear complementarity problems (Q1918925) (← links)
• A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization (Q2142525) (← links)
• Trajectory-following methods for large-scale degenerate convex quadratic programming (Q2392932) (← links)
• Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path (Q2467158) (← links)
• Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems (Q4240625) (← links)
• Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path (Q5312760) (← links)
• Une procédure de purification pour les problèmes de complémentarité linéaire, monotones (Q5479841) (← links)