Pages that link to "Item:Q695048"
From MaRDI portal
The following pages link to Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term (Q695048):
Displaying 28 items.
- A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function (Q384190) (← links)
- A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function (Q483254) (← links)
- An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term (Q513522) (← links)
- A novel neural network for solving semidefinite programming problems with some applications (Q1713177) (← links)
- Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term (Q1730836) (← links)
- Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function (Q1733331) (← links)
- A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions (Q1790186) (← links)
- A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization (Q2050559) (← 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)
- 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 method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function (Q2346488) (← 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)
- 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)
- An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step (Q4635027) (← 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)
- An predictor–corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood (Q5031228) (← links)
- A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization (Q5031729) (← 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)