Pages that link to "Item:Q611277"

The following pages link to A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems (Q611277):

Displaying 31 items.

• A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function (Q290328) (← links)
• Infeasible interior-point methods for linear optimization based on large neighborhood (Q306402) (← links)
• A polynomial interior-point algorithm for monotone linear complementarity problems (Q353166) (← links)
• A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization (Q378264) (← links)
• A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems (Q398651) (← links)
• A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function (Q451811) (← links)
• A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones (Q483262) (← links)
• A modified infeasible-interior-point algorithm for linear optimization problems (Q493065) (← links)
• An infeasible interior point method for the monotone SDLCP based on a transformation of the central path (Q721594) (← links)
• An adaptive infeasible interior-point algorithm for linear complementarity problems (Q743784) (← links)
• A full-Newton step infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem (Q890633) (← links)
• A path following interior-point method for linear complementarity problems over circular cones (Q1630229) (← links)
• An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function (Q1677001) (← links)
• A full-Newton step infeasible interior-point method for the special weighted linear complementarity problem (Q2046555) (← links)
• A full-Newton step interior-point method for monotone weighted linear complementarity problems (Q2198532) (← links)
• An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones (Q2361596) (← links)
• Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems (Q2376364) (← links)
• An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems (Q2399607) (← links)
• A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems (Q2422131) (← links)
• An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function (Q2634322) (← links)
• Linear complementarity model predictive control with limited iterations for box-constrained problems (Q2663927) (← links)
• A modified infeasible interior-point algorithm for P*(κ)-HLCP over symmetric cones (Q2805950) (← links)
• An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem (Q2808306) (← 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>_∗(<i>κ</i>)-HLCPs Over Cartesian Product of Symmetric Cones (Q2987781) (← links)
• An infeasible interior-point method with improved centering steps for monotone linear complementarity problems (Q3452701) (← links)
• (Q4604968) (← links)
• A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs (Q5241637) (← links)
• Full Nesterov–Todd step feasible interior-point method for the Cartesian<i>P</i>_*(κ)-SCLCP (Q5299915) (← links)
• A new class of infeasible interior-point algorithm for linear complementarity problem (Q5400131) (← links)
• A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-linear Complementarity problem (Q6492455) (← links)