Pages that link to "Item:Q2252687"

The following pages link to Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function (Q2252687):

Displayed 32 items.

• An efficient fifth-order method for linear optimization (Q306315) ‎ (← links)
• An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term (Q306399) ‎ (← links)
• An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term (Q513522) ‎ (← links)
• An efficient parameterized logarithmic kernel function for linear optimization (Q723500) ‎ (← links)
• An efficient twice parameterized trigonometric kernel function for linear optimization (Q779775) ‎ (← links)
• Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term (Q1724788) ‎ (← links)
• Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term (Q1730836) ‎ (← links)
• Interior-point algorithm for linear optimization based on a new trigonometric kernel function (Q1785406) ‎ (← links)
• A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions (Q1790186) ‎ (← links)
• An efficient parameterized logarithmic kernel function for semidefinite optimization (Q2023749) ‎ (← links)
• An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function (Q2053282) ‎ (← links)
• A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions (Q2062428) ‎ (← links)
• Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems (Q2115211) ‎ (← links)
• An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization (Q2218879) ‎ (← links)
• A generic kernel function for interior point methods (Q2245691) ‎ (← links)
• A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function (Q2245692) ‎ (← links)
• An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term (Q2303523) ‎ (← links)
• An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function (Q2346488) ‎ (← links)
• Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term (Q2353462) ‎ (← links)
• Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone (Q2405683) ‎ (← links)
• A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function (Q2817226) ‎ (← links)
• An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function (Q4606373) ‎ (← links)
• A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions (Q4639122) ‎ (← links)
• Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term (Q4646520) ‎ (← links)
• A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function (Q5009163) ‎ (← links)
• Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions (Q5081279) ‎ (← links)
• (Q5085900) ‎ (← links)
• An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function (Q5089362) ‎ (← links)
• Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term (Q6107947) ‎ (← links)
• Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions (Q6125139) ‎ (← links)
• Interior-point algorithm for linear programming based on a new descent direction (Q6140958) ‎ (← links)
• Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function (Q6189573) ‎ (← links)