Geodesic
Direct-dual Fej\'er methods for problems of quadratic programming
Trudy Instituta matematiki i mehaniki, Dynamical systems: modeling, optimization, and control, Tome 12 (2006) no. 1, pp. 86-97

Voir la notice de l'article provenant de la source Math-Net.Ru

The paper deals with the $S$-technology, which reduces convex problems of quadratic programming to the solution of systems of several linear, and one convex, inequalities. A certain variant of the Fejér method is applied to these systems. In particular, the problem of the constructive separability of convex polyhedral sets by a layer of maximal thickness is solved. This algorithm plays an important role in problems of discriminant analysis. 
@article{TIMM_2006_12_1_a7,
     author = {I. I. Eremin},
     title = {Direct-dual {Fej\'er} methods for problems of quadratic programming},
     journal = {Trudy Instituta matematiki i mehaniki},
     pages = {86--97},
     publisher = {mathdoc},
     volume = {12},
     number = {1},
     year = {2006},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TIMM_2006_12_1_a7/}
}
TY  - JOUR
AU  - I. I. Eremin
TI  - Direct-dual Fej\'er methods for problems of quadratic programming
JO  - Trudy Instituta matematiki i mehaniki
PY  - 2006
SP  - 86
EP  - 97
VL  - 12
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TIMM_2006_12_1_a7/
LA  - ru
ID  - TIMM_2006_12_1_a7
ER  - 
%0 Journal Article
%A I. I. Eremin
%T Direct-dual Fej\'er methods for problems of quadratic programming
%J Trudy Instituta matematiki i mehaniki
%D 2006
%P 86-97
%V 12
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TIMM_2006_12_1_a7/
%G ru
%F TIMM_2006_12_1_a7
I. I. Eremin. Direct-dual Fej\'er methods for problems of quadratic programming. Trudy Instituta matematiki i mehaniki, Dynamical systems: modeling, optimization, and control, Tome 12 (2006) no. 1, pp. 86-97. http://geodesic.mathdoc.fr/item/TIMM_2006_12_1_a7/