Pages that link to "Item:Q1785406"
From MaRDI portal
The following pages link to Interior-point algorithm for linear optimization based on a new trigonometric kernel function (Q1785406):
Displaying 19 items.
- 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 efficient parameterized logarithmic kernel function for linear optimization (Q723500) (← links)
- An efficient twice parameterized trigonometric kernel function for linear optimization (Q779775) (← links)
- A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions (Q1790186) (← links)
- Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems (Q2115211) (← 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)
- 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 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)
- An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function (Q5089362) (← 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)
