Pages that link to "Item:Q2581486"

The following pages link to An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation (Q2581486):

Displaying 12 items.

• A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function (Q290328) (← links)
• New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP (Q497434) (← links)
• A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step (Q734862) (← links)
• A new primal-dual path-following interior-point algorithm for semidefinite optimization (Q1014697) (← links)
• Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier (Q1616941) (← links)
• A path following interior-point method for linear complementarity problems over circular cones (Q1630229) (← links)
• Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function (Q2317415) (← links)
• An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones (Q2970393) (← links)
• (Q4577944) (← links)
• Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function (Q5038177) (← links)
• Unified approach of interior-point algorithms for \(P_* (\kappa)\)-LCPs using a new class of algebraically equivalent transformations (Q6596327) (← links)
• New predictor-corrector algorithm for symmetric cone horizontal linear complementarity problems (Q6596328) (← links)