Nonsmooth minimization problems for the difference of two convex functions
Numerical methods and programming, Tome 12 (2011) no. 4, pp. 384-396.

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

The global search theory in nonsmooth d.c. minimization problems (the goal function is represented as the difference of two convex functions) is generalized to the nondifferentiable case. Several algorithms of local and global search in problems with nonsmooth goal functions are proposed and their convergence is studied. The proposed algorithms are numerically tested.
Keywords: nonconvex optimization; d.c. function; nonsmooth problems; local search; global search strategy; convergence theorems; numerical simulation.
@article{VMP_2011_12_4_a0,
     author = {T. V. Gruzdeva and A. S. Strekalovskii and A. V. Orlov and O. V. Druzinina},
     title = {Nonsmooth minimization problems for the difference of two convex functions},
     journal = {Numerical methods and programming},
     pages = {384--396},
     publisher = {mathdoc},
     volume = {12},
     number = {4},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMP_2011_12_4_a0/}
}
TY  - JOUR
AU  - T. V. Gruzdeva
AU  - A. S. Strekalovskii
AU  - A. V. Orlov
AU  - O. V. Druzinina
TI  - Nonsmooth minimization problems for the difference of two convex functions
JO  - Numerical methods and programming
PY  - 2011
SP  - 384
EP  - 396
VL  - 12
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VMP_2011_12_4_a0/
LA  - ru
ID  - VMP_2011_12_4_a0
ER  - 
%0 Journal Article
%A T. V. Gruzdeva
%A A. S. Strekalovskii
%A A. V. Orlov
%A O. V. Druzinina
%T Nonsmooth minimization problems for the difference of two convex functions
%J Numerical methods and programming
%D 2011
%P 384-396
%V 12
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VMP_2011_12_4_a0/
%G ru
%F VMP_2011_12_4_a0
T. V. Gruzdeva; A. S. Strekalovskii; A. V. Orlov; O. V. Druzinina. Nonsmooth minimization problems for the difference of two convex functions. Numerical methods and programming, Tome 12 (2011) no. 4, pp. 384-396. http://geodesic.mathdoc.fr/item/VMP_2011_12_4_a0/