Pages that link to "Item:Q1881563"
From MaRDI portal
The following pages link to A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity (Q1881563):
Displaying 31 items.
- Infeasible interior-point methods for linear optimization based on large neighborhood (Q306402) (← 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)
- Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems (Q630020) (← links)
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones (Q650213) (← links)
- Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path (Q722338) (← links)
- New method for determining search directions for interior-point algorithms in linear optimization (Q723503) (← 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)
- A path following method for LCP with superlinearly convergent iteration sequence (Q1265875) (← links)
- Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood (Q1787924) (← links)
- A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity (Q1881563) (← links)
- Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence (Q1893347) (← links)
- A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization (Q2142525) (← links)
- A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization (Q2228364) (← 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)
- Superlinear convergence of an algorithm for monotone linear complementarity problems, when no strictly complementary solution exists (Q2757583) (← links)
- An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones (Q2970393) (← links)
- A Corrector-Predictor Interior-Point Algorithm for <i>P</i><sub>∗</sub>(<i>κ</i>)-HLCPs Over Cartesian Product of Symmetric Cones (Q2987781) (← links)
- Superlinear Convergence of an Infeasible Predictor-Corrector Path-Following Interior Point Algorithm for a Semidefinite Linear Complementarity Problem Using the Helmberg–Kojima–Monteiro Direction (Q3004976) (← links)
- (Q3057248) (← links)
- A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization (Q4622888) (← links)
- A long-step interior-point algorithm for symmetric cone Cartesian <i>P</i><sub>*</sub>(κ)-HLCP (Q4646542) (← links)
- Complexity of Predictor-Corrector Algorithms for LCP Based on a Large Neighborhood of the Central Path (Q4943612) (← links)
- Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction (Q4971018) (← links)
- Interior-point methods for Cartesian<i>P</i><sub>*</sub>(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions (Q5200563) (← links)
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path (Q5312760) (← links)
- A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation (Q6166934) (← links)
- Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation (Q6491339) (← links)
- A new Ai-Zhang type interior point algorithm for sufficient linear complementarity problems (Q6596329) (← links)