Pages that link to "Item:Q1319022"

The following pages link to On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP (Q1319022):

Displaying 50 items.

• A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function (Q255679) (← links)
• 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)
• Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems (Q630020) (← links)
• Predictor-corrector smoothing methods for monotone LCP (Q705035) (← links)
• Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path (Q722338) (← links)
• A combined homotopy interior point method for the linear complementarity problem (Q849782) (← links)
• A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming (Q853883) (← links)
• A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems (Q877592) (← links)
• Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms (Q881509) (← links)
• Asymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory (Q927226) (← links)
• Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem (Q985306) (← links)
• A polynomial path-following interior point algorithm for general linear complementarity problems (Q989885) (← links)
• Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization (Q995953) (← links)
• Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions (Q997220) (← links)
• On the analyticity of underlying HKM paths for monotone semidefinite linear complementarity problems (Q1029277) (← links)
• Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP (Q1264999) (← links)
• Quadratic convergence of a long-step interior-point method for nonlinear monotone variational inequality problems (Q1265014) (← links)
• Local convergence of interior-point algorithms for degenerate monotone LCP (Q1326510) (← links)
• Global convergence in infeasible-interior-point algorithms (Q1334952) (← links)
• An infeasible-interior-point algorithm for linear complementarity problems (Q1340065) (← links)
• Asymptotic convergence in a generalized predictor-corrector method (Q1352296) (← links)
• Fast convergence of the simplified largest step path following algorithm (Q1361106) (← links)
• The largest step path following algorithm for monotone linear complementarity problems (Q1363413) (← links)
• Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422) (← links)
• Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs (Q1380924) (← links)
• Predictor-corrector method for nonlinear complementarity problems (Q1387608) (← links)
• The sign-based methods for solving a class of nonlinear complementarity problems (Q1730396) (← links)
• Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem (Q1760104) (← links)
• On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
• Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems. (Q1807690) (← links)
• An interior point potential reduction method for constrained equations (Q1814789) (← links)
• On the convergence rate of Newton interior-point methods in the absence of strict complementarity (Q1816402) (← links)
• The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path (Q1848380) (← links)
• Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence (Q1893347) (← links)
• A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem (Q1906276) (← links)
• A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems (Q1913863) (← links)
• An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence (Q1915906) (← links)
• A path-following interior-point algorithm for linear and quadratic problems (Q1915907) (← links)
• A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence (Q1915908) (← links)
• A superquadratic infeasible-interior-point method for linear complementarity problems (Q1918925) (← links)
• An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635) (← links)
• A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization (Q2142525) (← links)
• On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods (Q2227537) (← links)
• On the convergence of a predictor-corrector variant algorithm (Q2355008) (← links)
• Newton-type methods for solving quasi-complementarity problems via sign-based equation (Q2424228) (← links)
• Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path (Q2467158) (← links)
• A new noninterior predictor-corrector method for the \(P_0\) LCP (Q2492878) (← links)
• A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems^* (Q2709447) (← links)
• Superlinear convergence of an algorithm for monotone linear complementarity problems, when no strictly complementary solution exists (Q2757583) (← links)