Pages that link to "Item:Q2911579"

The following pages link to A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS (Q2911579):

Displaying 8 items.

• A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function (Q483254) (← links)
• A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones (Q483262) (← links)
• New method for determining search directions for interior-point algorithms in linear optimization (Q723503) (← links)
• A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization (Q743780) (← links)
• Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation (Q828652) (← links)
• Complexity analysis of a full-{N}ewton step interior-point method for linear optimization (Q1677554) (← links)
• A corrector-predictor interior-point method with new search direction for linear optimization (Q2201317) (← links)
• An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones (Q2970393) (← links)