Geodesic
Using of modified simplex imbeddings method for solving special class of convex non-differentiable optimization problems
The Bulletin of Irkutsk State University. Series Mathematics, Tome 11 (2015), pp. 54-68
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

In this paper it is considered the modified simplex imbeddings method, which is related to the class of cutting plane methods. The main feature of this method is the convergence estimation, which depends only on the quantity of simplex vertices, that are cut off by the cutting plane. The more vertices are cut off by the cutting plane, the higher speed of method convergence. Modified method of simplex imbeddings with such criteria of cutting plane choosing is applied to solving special class of convex non-differentiable problems, which is consists of two types of functions. We come across the necessity to describe the function subdifferential that is depends on one or several parameters, that we can subject to optimization. It is described functions subdifferentials from the introduced class in parametric representation, that let us form auxiliary problems in simplex imbeddings method for searching resulting cutting planes, that cut off as much vertices of simplex as possible. It let us increase the speed of finding optimal solution. The results of numerical experiment are also given in this paper.
Keywords: modified simplex imbeddings method, subdifferential of convex functions, resulting cutting plane. 
@article{IIGUM_2015_11_a4,
     author = {A. V. Kolosnitcyn},
     title = {Using of modified simplex imbeddings method for solving special class of~convex non-differentiable optimization problems},
     journal = {The Bulletin of Irkutsk State University. Series Mathematics},
     pages = {54--68},
     year = {2015},
     volume = {11},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IIGUM_2015_11_a4/}
}
TY  - JOUR
AU  - A. V. Kolosnitcyn
TI  - Using of modified simplex imbeddings method for solving special class of convex non-differentiable optimization problems
JO  - The Bulletin of Irkutsk State University. Series Mathematics
PY  - 2015
SP  - 54
EP  - 68
VL  - 11
UR  - http://geodesic.mathdoc.fr/item/IIGUM_2015_11_a4/
LA  - ru
ID  - IIGUM_2015_11_a4
ER  - 
%0 Journal Article
%A A. V. Kolosnitcyn
%T Using of modified simplex imbeddings method for solving special class of convex non-differentiable optimization problems
%J The Bulletin of Irkutsk State University. Series Mathematics
%D 2015
%P 54-68
%V 11
%U http://geodesic.mathdoc.fr/item/IIGUM_2015_11_a4/
%G ru
%F IIGUM_2015_11_a4
A. V. Kolosnitcyn. Using of modified simplex imbeddings method for solving special class of convex non-differentiable optimization problems. The Bulletin of Irkutsk State University. Series Mathematics, Tome 11 (2015), pp. 54-68. http://geodesic.mathdoc.fr/item/IIGUM_2015_11_a4/

[1] Antsiferov E. G., Bulatov V. P., “An algorithm of simplex imbeddings in convex programming”, Zh. vychisl. Mat. mat. Fiz., 27:3 (1987), 377–384 (in Russian)

[2] Apekina E. V., Khamisov O. V., “A modified simplex immersions method with simultaneous introduction of several intersecting planes”, Izv. Vysh. Uchebn Zaved., Mat., 1997, no. 12, 16–24 (in Russian)

[3] Izmailov A. F., Solodov M. V., Numerical optimization methods, Fizmatlit, M., 2005, 304 pp. (in Russian)

[4] Minu M., Mathematical programming. Theory and algorithms, Nauka, M., 1990, 488 pp. (in Russian)

[5] Nesterov Yu. E., Convex optimization methods, MTSNMO, M., 2010, 280 pp. (in Russian)

[6] Nurminski E. A., Numerical methods of convex optimization, Nauka, M., 1991, 168 pp. (in Russian)

[7] Polyak B. T., Introduction to optimization, Nauka, M., 1983, 384 pp. (in Russian)

[8] Shor N. Z., Methods of minimization of non-differentiable functions and their applications, Nauk. dumka, Kiev, 1979, 200 pp. (in Russian)

[9] J. F. Bonnans, J. C. Gilbert, C. Lemarechal, C. A. Sagastizaabal, Numerical Optimization. Theoretical and Practical Aspects, Second edition, Springer-Verlag, Berlin, 2006, 494 pp.