Geodesic
Convergence of a numerical abstract convexity algorithm
Izvestiya. Mathematics , Tome 73 (2009) no. 1, pp. 3-19

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

We propose a series of algorithms for solving abstract convex programming problems and prove convergence to the global solution of the problem. The algorithms use an approximation of the objective function by piecewise-linear minorants.
Keywords: convex analysis, global optimization, branching algorithm, generalized cutting-plane method. 
@article{IM2_2009_73_1_a1,
     author = {M. Yu. Andramonov},
     title = {Convergence of a numerical abstract convexity algorithm},
     journal = {Izvestiya. Mathematics },
     pages = {3--19},
     publisher = {mathdoc},
     volume = {73},
     number = {1},
     year = {2009},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/IM2_2009_73_1_a1/}
}
TY  - JOUR
AU  - M. Yu. Andramonov
TI  - Convergence of a numerical abstract convexity algorithm
JO  - Izvestiya. Mathematics 
PY  - 2009
SP  - 3
EP  - 19
VL  - 73
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IM2_2009_73_1_a1/
LA  - en
ID  - IM2_2009_73_1_a1
ER  - 
%0 Journal Article
%A M. Yu. Andramonov
%T Convergence of a numerical abstract convexity algorithm
%J Izvestiya. Mathematics 
%D 2009
%P 3-19
%V 73
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IM2_2009_73_1_a1/
%G en
%F IM2_2009_73_1_a1
M. Yu. Andramonov. Convergence of a numerical abstract convexity algorithm. Izvestiya. Mathematics , Tome 73 (2009) no. 1, pp. 3-19. http://geodesic.mathdoc.fr/item/IM2_2009_73_1_a1/