Article contents
A modified algorithm for the strict feasibility problem
Published online by Cambridge University Press: 15 August 2002
Abstract
In this note, we present a slight modification of an algorithm for the strict feasibility problem. This modification reduces the number of iterations.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2001
References
D. Benterki, Étude des performances de l'algorithme de Karmarkar pour la programmation linéaire. Thèse de Magister, Département de Mathématiques, Université de Annaba, Algérie (1992).
J.C. Culioli, Introduction à l'optimisation. Édition Marketing, Ellipses, Paris (1994).
I.J. Lustig, A pratical approach to Karmarkar's algorithm. Technical report sol 85-5, Department of Operations Research Stanford University, Stanford, California.
A. Keraghel, Étude adaptative et comparative des principales variantes dans l'algorithme de Karmarkar, Thèse de Doctorat de mathématiques appliquées. Université Joseph Fourier, Grenoble, France (1989).
Shanno, D.F. and Marsten, R.E., A reduced-gradient variant of Karmarkar's algorithm and null-space projections.
J. Optim. Theory Appl.
57 (1988) 383-397.
CrossRef
S.J. Wright, Primal-dual interior point method. SIAM, Philadelphia, PA (1997).
- 2
- Cited by