Pages that link to "Item:Q1319022"
From MaRDI portal
The following pages link to On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP (Q1319022):
Displayed 34 items.
- 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)
- 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)
- 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)
- 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)
- 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)
- 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)
- Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path (Q2467158) (← links)
- A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems<sup>*</sup> (Q2709447) (← links)
- Mehrotra-type predictor-corrector algorithm revisited (Q3539794) (← 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)