Pages that link to "Item:Q432785"

The following pages link to Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term (Q432785):

Displaying 36 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)
• Kernel function based interior-point methods for horizontal linear complementarity problems (Q394593) (← links)
• An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term (Q513522) (← links)
• Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term (Q695048) (← links)
• An efficient parameterized logarithmic kernel function for linear optimization (Q723500) (← links)
• Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function (Q742844) (← links)
• An efficient twice parameterized trigonometric kernel function for linear optimization (Q779775) (← links)
• An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function (Q1677001) (← 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)
• A wide neighborhood interior-point algorithm based on the trigonometric kernel function (Q2053067) (← links)
• An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function (Q2053282) (← links)
• Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems (Q2115211) (← links)
• Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
• A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps (Q2192573) (← 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)
• Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function (Q2252687) (← 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)
• Relaxing high-dimensional constraints in the direct solution space method for early phase development (Q2315082) (← 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)
• A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds (Q2361520) (← 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)
• Complexity analysis of interior point methods for linear programming based on a parameterized kernel function (Q2954362) (← links)
• An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function (Q4606373) (← 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)