An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
From MaRDI portal
Publication:4593509
DOI10.7508/ijmsi.2017.01.011zbMath1375.90234OpenAlexW2742307938MaRDI QIDQ4593509
M. Reza Peyghami, S. Fathi Hafshejani
Publication date: 22 November 2017
Full work available at URL: http://ijmsi.ir/article-1-671-en.html
kernel functionprimal-dual interior-point methodsiteration complexityconvex quadratic semidefinite optimization problem
Related Items (5)
An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function ⋮ An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization ⋮ A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions ⋮ Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term ⋮ An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function
This page was built for publication: An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
