Refine your search
Collections
Co-Authors
Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Kabbaj, S.
- Improved Full Newton Step Infeasible O(nL) Interior Point Method Based Kernel Function
Abstract Views :326 |
PDF Views:0
Authors
Affiliations
1 Department of Mathematics and Informatics, University Ibn Tofail, Faculty of Sciences, B.P. 133 Kenitra 14000, MA
1 Department of Mathematics and Informatics, University Ibn Tofail, Faculty of Sciences, B.P. 133 Kenitra 14000, MA
Source
International Journal of Computational and Applied Mathematics, Vol 7, No 2 (2012), Pagination: 199–217Abstract
Inspired by the work of Roos [6] and also Liu [9], we propose a more stable algorithm for IIPMs based kernel function. The main iteration of the algorithm consists of a feasibility step and several centrality steps. The Newton process was established in a wider neighborhood using a sharper quadratic convergence results. The complexity result coincides with the currently best known iteration bound.Keywords
Linear Programming, Infeasible Interior-point Method, Full-newton Step, Polynomial Complexity, Kernel Function
References
- H. Mansouri C. Roos. SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-newton steps. Optim. Methods Softw, 22:519–530, 2007.
- J. Peng C. Roos and T. Terlaky. Self-regular functions and new search directions for linear and semidefinite optimization. Math. Program, 2002.
- S. Mizuno. Polynomiality of infeasible-interior-point algorithms for linear programming. Math. Program, 67:109–119, 1994.
- G.Gu H.Mansouri M.Zangiabadi, Y.Q.Bai and C.Roos. Improved full-newton step O(nL) infeasible interior-point method for linear optimization. Journal Optimization Theory Application, 145:271–288, 2010.
- Y.Q. Bai M. El Ghami and C. Roos. A comparative study of kernel functions for primal-dual interior-point algorithms in linear optimization. SIAM J. Opt, 15:101– 128, 2004.
- C. Roos. A full-newton step O(n) infeasible interior-point algorithm for linear optimization. SIAM J. Optim, 16:1110–1136, 2006.
- C. Roos T. Terlaky and J.-Ph. Vial. Interior Point Methods for Linear Optimization. (2nd edn. of Theory and Algorithms for Linear Optimization. Wiley, Chichester( 1997)), Springer NewYork (2006).
- Y.Ye. Interior Point Algorithms. Wiley-Interscience Series in Discrete Mathematics and Optimization.Wiley, NewYork (1997).
- W. Sun Z. Liu and F. Tian.A full-newton step infeasible interior-point algorithm for linear programming based on a kernel function. Applied Mathematics and Optimization, 60:237–251, 2009.