TY  - JOUR
AU  - A. V. Kolosnitsyn
TI  - A modified simplex embedding method for solving convex optimization problems with a large amount of constraints
JO  - Numerical methods and programming
PY  - 2019
SP  - 428
EP  - 437
VL  - 20
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VMP_2019_20_4_a6/
LA  - ru
ID  - VMP_2019_20_4_a6
ER  -