Geodesic
Iterative algorithm for mathematical programming problems with preconvex constraints
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 50 (2010) no. 5, pp. 832-835

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

An iterative algorithm is proposed for minimizing a convex function on a set defined as the set-theoretic difference between a convex set and the union of several convex sets. The convergence of the algorithm is proved in terms of necessary conditions for a local minimum. 
@article{ZVMMF_2010_50_5_a3,
     author = {T. F. Minnibaev and Yu. A. Chernyaev},
     title = {Iterative algorithm for mathematical programming problems with preconvex constraints},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {832--835},
     publisher = {mathdoc},
     volume = {50},
     number = {5},
     year = {2010},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2010_50_5_a3/}
}
TY  - JOUR
AU  - T. F. Minnibaev
AU  - Yu. A. Chernyaev
TI  - Iterative algorithm for mathematical programming problems with preconvex constraints
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2010
SP  - 832
EP  - 835
VL  - 50
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2010_50_5_a3/
LA  - ru
ID  - ZVMMF_2010_50_5_a3
ER  - 
%0 Journal Article
%A T. F. Minnibaev
%A Yu. A. Chernyaev
%T Iterative algorithm for mathematical programming problems with preconvex constraints
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2010
%P 832-835
%V 50
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZVMMF_2010_50_5_a3/
%G ru
%F ZVMMF_2010_50_5_a3
T. F. Minnibaev; Yu. A. Chernyaev. Iterative algorithm for mathematical programming problems with preconvex constraints. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 50 (2010) no. 5, pp. 832-835. http://geodesic.mathdoc.fr/item/ZVMMF_2010_50_5_a3/