Pages that link to "Item:Q4895564"

The following pages link to A Superlinearly Convergent Infeasible-Interior-Point Algorithm for Geometrical LCPs Without a Strictly Complementary Condition (Q4895564):

Displaying 9 items.

• A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming (Q853883) (← links)
• Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP (Q1264999) (← links)
• Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points (Q1361112) (← links)
• Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs (Q1380924) (← links)
• On the convergence rate of Newton interior-point methods in the absence of strict complementarity (Q1816402) (← links)
• A predictor-corrector method for extended linear-quadratic programming (Q1919785) (← 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)
• Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path (Q5312760) (← links)