Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term - MaRDI portal

A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term

From MaRDI portal
Publication:5278842

DOI10.2298/YJOR120904006KzbMath1474.90279OpenAlexW2008526046MaRDI QIDQ5278842

Behrouz Kheirfam, Morteza Moslemi

Publication date: 19 July 2017

Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/yjor120904006k




Related Items (13)

An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier termAn infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel functionA full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering stepsComplexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functionsInterior-point algorithm for linear programming based on a new descent directionComplexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel functionComplexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel functionA new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel functionAn efficient parameterized logarithmic kernel function for linear optimizationAn interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel functionA full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel functionAn efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier termA primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function




This page was built for publication: A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term