On the reducibility of a general convex programming problem to an unconditional extremum problem
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 12 (1995), pp. 10-18.

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

@article{IVM_1995_12_a1,
     author = {E. G. Belousov and V. G. Andronov},
     title = {On the reducibility of a general convex programming problem to an unconditional extremum problem},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {10--18},
     publisher = {mathdoc},
     number = {12},
     year = {1995},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_1995_12_a1/}
}
TY  - JOUR
AU  - E. G. Belousov
AU  - V. G. Andronov
TI  - On the reducibility of a general convex programming problem to an unconditional extremum problem
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 1995
SP  - 10
EP  - 18
IS  - 12
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_1995_12_a1/
LA  - ru
ID  - IVM_1995_12_a1
ER  - 
%0 Journal Article
%A E. G. Belousov
%A V. G. Andronov
%T On the reducibility of a general convex programming problem to an unconditional extremum problem
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 1995
%P 10-18
%N 12
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_1995_12_a1/
%G ru
%F IVM_1995_12_a1
E. G. Belousov; V. G. Andronov. On the reducibility of a general convex programming problem to an unconditional extremum problem. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 12 (1995), pp. 10-18. http://geodesic.mathdoc.fr/item/IVM_1995_12_a1/