Pages that link to "Item:Q1918925"
From MaRDI portal
The following pages link to A superquadratic infeasible-interior-point method for linear complementarity problems (Q1918925):
Displaying 10 items.
- A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem (Q606335) (← links)
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones (Q650213) (← links)
- Fast convergence of the simplified largest step path following algorithm (Q1361106) (← links)
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points (Q1361112) (← links)
- Infeasible predictor-corrector interior-point method applied to image restoration in the presence of noise (Q1573984) (← links)
- The sign-based methods for solving a class of nonlinear complementarity problems (Q1730396) (← links)
- Optimized choice of parameters in interior-point methods for linear programming (Q2419556) (← links)
- Newton-type methods for solving quasi-complementarity problems via sign-based equation (Q2424228) (← links)
- The complexity of self-regular proximity based infeasible IPMs (Q2506182) (← links)
- An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones (Q2970393) (← links)
