Pages that link to "Item:Q5436917"

The following pages link to Simplified<i>O</i>(<i>nL</i>) infeasible interior-point algorithm for linear optimization using full-Newton steps (Q5436917):

Displaying 33 items.

• 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)
• Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step (Q411535) (← links)
• A predictor-corrector algorithm with multiple corrections for convex quadratic programming (Q453603) (← links)
• Full-NT step infeasible interior-point method for SOCO based on a specific kernel function (Q471570) (← links)
• A modified infeasible-interior-point algorithm for linear optimization problems (Q493065) (← links)
• A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems (Q611277) (← links)
• A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions (Q627154) (← links)
• A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
• Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO (Q747738) (← links)
• A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function (Q843962) (← links)
• A full-Newton step infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem (Q890633) (← links)
• Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization (Q987511) (← links)
• Complexity analysis of a full-{N}ewton step interior-point method for linear optimization (Q1677554) (← links)
• Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function (Q1733331) (← links)
• Simplified infeasible interior-point algorithm for linear optimization based on a simple function (Q2294231) (← links)
• Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function (Q2317415) (← links)
• Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems (Q2376364) (← links)
• Two wide neighborhood interior-point methods for symmetric cone optimization (Q2401022) (← links)
• An entire space polynomial-time algorithm for linear programming (Q2442633) (← links)
• An infeasible interior-point algorithm with full-Newton step for linear optimization (Q2464638) (← links)
• A full-modified-Newton step infeasible interior-point algorithm for linear optimization (Q2515270) (← 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 predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity (Q2836103) (← links)
• A new infeasible interior-point algorithm with full step for linear optimization based on a simple function (Q2885543) (← links)
• A full NT-step infeasible interior-point algorithm for semidefinite optimization based on a self-regular proximity (Q2895762) (← links)
• A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log <i>ϵ</i>⁻¹) iteration complexity (Q3174878) (← links)
• An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization (Q4916322) (← links)
• New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization (Q4987772) (← links)
• A primal-dual interior-point method based on a new kernel function for linear complementarity problem (Q5243687) (← links)
• A new class of infeasible interior-point algorithm for linear complementarity problem (Q5400131) (← links)
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization (Q5470235) (← links)
• A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term (Q6046863) (← links)