DocumentCode
2679239
Title
Notice of Retraction
A polynomial-time algorithm for linear optimization based on a new class of parametric kernel function
Author
Lipu Zhang ; Yinghong Xu
Author_Institution
Dept. of Math., Zhejiang Forestry Univ., Hangzhou, China
Volume
5
fYear
2010
fDate
27-29 March 2010
Firstpage
503
Lastpage
507
Abstract
Notice of Retraction
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
In this paper, we present a class of polynomial primal-dual interior-point algorithms for linear optimization based on a new class of parametric kernel functions. This class is fairly general and includes several classes of kernel functions, such as given in [1, 4]. The goal of this paper is to investigate such a class of kernel functions and to show that the interior-point methods based on these functions have favorable complexity results.
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
In this paper, we present a class of polynomial primal-dual interior-point algorithms for linear optimization based on a new class of parametric kernel functions. This class is fairly general and includes several classes of kernel functions, such as given in [1, 4]. The goal of this paper is to investigate such a class of kernel functions and to show that the interior-point methods based on these functions have favorable complexity results.
Keywords
optimisation; polynomials; linear optimization; parametric kernel function; polynomial time algorithm; primal dual interior point algorithms; Algorithm design and analysis; Books; Forestry; Guidelines; Kernel; Mathematics; Optimization methods; Polynomials; complexity analysis; kernel function; linear optimization; primal dual interior point methods;
fLanguage
English
Publisher
ieee
Conference_Titel
Advanced Computer Control (ICACC), 2010 2nd International Conference on
Conference_Location
Shenyang
Print_ISBN
978-1-4244-5845-5
Type
conf
DOI
10.1109/ICACC.2010.5487123
Filename
5487123
Link To Document