Pages that link to "Item:Q538303"
From MaRDI portal
The following pages link to Corrector-predictor methods for sufficient linear complementarity problems (Q538303):
Displaying 28 items.
- An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem (Q261844) (← links)
- Sufficient weighted complementarity problems (Q288407) (← links)
- A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function (Q290328) (← links)
- A polynomial interior-point algorithm for monotone linear complementarity problems (Q353166) (← links)
- A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems (Q398651) (← links)
- Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems (Q630020) (← links)
- A smoothing Newton method with a mixed line search for monotone weighted complementarity problems (Q782310) (← links)
- Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem (Q1760104) (← links)
- A full-Newton step interior-point method for monotone weighted linear complementarity problems (Q2198532) (← links)
- A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems (Q2249820) (← links)
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem (Q2249832) (← links)
- A corrector-predictor path-following method for convex quadratic symmetric cone optimization (Q2260663) (← links)
- A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems (Q2356344) (← links)
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems (Q2376364) (← links)
- A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems (Q2422131) (← links)
- A homotopy method for solving the horizontal linear complementarity problem (Q2514030) (← links)
- An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function (Q2634322) (← links)
- A new corrector-predictor interior-point method for symmetric cone optimization (Q2678433) (← links)
- A full Nesterov–Todd step infeasible-interior-point algorithm for Cartesian<i>P</i><sub>*</sub>(κ) horizontal linear complementarity problems over symmetric cones (Q2790893) (← links)
- Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects (Q2802530) (← links)
- A corrector–predictor path-following algorithm for semidefinite optimization (Q2920903) (← links)
- A Corrector-Predictor Interior-Point Algorithm for <i>P</i><sub>∗</sub>(<i>κ</i>)-HLCPs Over Cartesian Product of Symmetric Cones (Q2987781) (← links)
- A long-step interior-point algorithm for symmetric cone Cartesian <i>P</i><sub>*</sub>(κ)-HLCP (Q4646542) (← links)
- Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction (Q4971018) (← links)
- A new second-order corrector interior-point algorithm for P*(k)-LCP (Q5023102) (← links)
- Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP (Q5198050) (← links)
- A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP (Q5379298) (← links)
- Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation (Q6491339) (← links)