Pages that link to "Item:Q4405935"

The following pages link to A primal‐dual interior-point method for linear optimization based on a new proximity function (Q4405935):

Displaying 18 items.

• A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO (Q634734) (← links)
• A polynomial-time algorithm for linear optimization based on a new class of kernel functions (Q1002187) (← links)
• A class of large-update and small-update primal-dual interior-point algorithms for linear optimization (Q1014009) (← links)
• The accuracy of interior-point methods based on kernel functions (Q1935292) (← links)
• Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term (Q2018886) (← links)
• A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function (Q2245692) (← links)
• Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization (Q2340161) (← links)
• Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone (Q2405683) (← links)
• A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems (Q2483352) (← links)
• Interior-point methods based on kernel functions for symmetric optimization (Q2885493) (← links)
• A new infeasible interior-point algorithm with full step for linear optimization based on a simple function (Q2885543) (← links)
• Generic Primal-dual Interior Point Methods Based on a New Kernel Function (Q3539807) (← links)
• Interior-point algorithm based on general kernel function for monotone linear complementarity problem (Q3572642) (← links)
• Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term (Q4646520) (← links)
• Interior-point methods for Cartesian<i>P</i>_*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions (Q5200563) (← links)
• A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function (Q5299916) (← links)
• A new primal-dual interior-point algorithm for convex quadratic optimization (Q5320227) (← links)
• Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization (Q5320239) (← links)