Geodesic
An interior point algorithm for convex quadratic programming with strict equilibrium constraints
RAIRO - Operations Research - Recherche Opérationnelle, Tome 39 (2005) no. 1, pp. 13-33

Voir la notice de l'article provenant de la source Numdam

We describe an interior point algorithm for convex quadratic problem with a strict complementarity constraints. We show that under some assumptions the approach requires a total of O(nL) number of iterations, where L is the input size of the problem. The algorithm generates a sequence of problems, each of which is approximately solved by Newton’s method.

DOI : 10.1051/ro:2005002
Keywords: convex quadratic programming with a strict equilibrium constraints, interior point algorithm, Newton's method 
@article{RO_2005__39_1_13_0,
     author = {Benouahboun, Rachid and Mansouri, Abdelatif},
     title = {An interior point algorithm for convex quadratic programming with strict equilibrium constraints},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {13--33},
     publisher = {EDP-Sciences},
     volume = {39},
     number = {1},
     year = {2005},
     doi = {10.1051/ro:2005002},
     mrnumber = {2166343},
     zbl = {1102.90041},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1051/ro:2005002/}
}
TY  - JOUR
AU  - Benouahboun, Rachid
AU  - Mansouri, Abdelatif
TI  - An interior point algorithm for convex quadratic programming with strict equilibrium constraints
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2005
SP  - 13
EP  - 33
VL  - 39
IS  - 1
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ro:2005002/
DO  - 10.1051/ro:2005002
LA  - en
ID  - RO_2005__39_1_13_0
ER  - 
%0 Journal Article
%A Benouahboun, Rachid
%A Mansouri, Abdelatif
%T An interior point algorithm for convex quadratic programming with strict equilibrium constraints
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 2005
%P 13-33
%V 39
%N 1
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ro:2005002/
%R 10.1051/ro:2005002
%G en
%F RO_2005__39_1_13_0
Benouahboun, Rachid; Mansouri, Abdelatif. An interior point algorithm for convex quadratic programming with strict equilibrium constraints. RAIRO - Operations Research - Recherche Opérationnelle, Tome 39 (2005) no. 1, pp. 13-33. doi: 10.1051/ro:2005002

Cité par Sources :