Везде
A FAMILY OF RELAXATION SUBGRADIENT METHODS WITH TWO-RANK CORRECTION OF METRIC MATRICES
Table of contents
Annotation Estimate Publication content
References Comments
Share
QR
Metrics
A FAMILY OF RELAXATION SUBGRADIENT METHODS WITH TWO-RANK CORRECTION OF METRIC MATRICES
Annotation
PII
S042473880000616-6-1
Publication type
Article
Status
Published
Authors
Tatiana Gorskaya  Vladimir Krutikov
Edition
Issue №4
Pages
105-120
Abstract
The family of relaxation sub-gradient methods with double-rank correction of matrixes of the metrics for solving non-smooth absolute optimization is suggested. Convergence of its algorithms has been proven with strictly convex functions. Results of numerical research are presented of one algorithm of family.
Keywords
-
Date of publication
01.10.2009
Number of purchasers
0
Views
771
Readers community rating
0.0 (0 votes)
Cite   Download pdf
1

References



Additional sources and materials

Behr K., Gol'shtejn E.G., Sokolov N.A. (2000): Ob ispol'zovanii metoda urovnej dlya minimizatsii vypuklykh funktsij, ne vse znacheniya kotorykh konechny // Ehkonomika i mat. metody. T. 36. № 4.
 Gol'shtejn E.G., Nemirovskij A.S., Nesterov Yu.E. (1995): Metod urovnej, ego obobscheniya i prilozheniya // Ehkonomika i mat. metody. T. 31. Vyp. 3.
 Gol'shtejn E.G. (2006): Metod minimizatsii negladkikh kvazivypuklykh funktsij, ispol'zuyuschij netochnye dannye // Ehkonomika i mat. metody. T. 42. № 2.
 Dem'yanov V.F., Vasil'ev L.V. (1981): Nedifferentsiruemaya optimizatsiya. M.: Nauka.
 Denis Dzh., Shnabel' R. (1988): Chislennye metody bezuslovnoj optimizatsii i resheniya nelinejnykh uravnenij. M.: Mir.
 Krutikov V.N., Petrova T.V. (2003): Relaksatsionnyj metod minimizatsii s rastyazheniem prostranstva v napravlenii subgradienta // Ehkonomika i mat. metody. T. 39. № 1.
 Krutikov V.N. (2003): Odnorangovoe semejstvo relaksatsionnykh subgradientnykh metodov s rastyazheniem prostranstva // Ehlektronnyj zhurnal “Issledovano v Rossii”. № 209.
 Krutikov V.N., Aryshev D.V. (2004): Realizatsiya algoritmov odnorangovogo semejstva subgradientnykh metodov // Ehlektronnyj zhurnal “Issledovano v Rossii”. № 43.
 Krutikov V.N., Aryshev D.V. (2005): Subgradientnyj metod s rastyazheniem–szhatiem prostranstva // Vestnik KemGU. Vyp. 4 (22).
 Nemirovskij A.S., Yudin D.B. (1979): Slozhnost' zadach i ehffektivnost' metodov optimizatsii. M.: Nauka.
 Nesterova S.I., Skokov V.A. (1994): Chislennyj analiz programm negladkoj bezuslovnoj optimizatsii // Ehkonomika i mat. metody. T. 30. Vyp. 2.
 Nesterov Yu.E., Purmal'E.I. (1984): Analiz ehffektivnosti metodov negladkoj optimizatsii. M.: TsEhMI AN SSSR.
 Skokov V.A. (1997): Varianty metoda urovnej dlya minimizatsii negladkikh vypuklykh funktsij i ikh chislennoe issledovanie // Ehkonomika i mat. metody. T. 33. Vyp. 1.
 Skokov V.A., Schepakin M.B. (1994): Chislennyj analiz odnogo varianta metoda ortogonal'nogo spuska Kibernetika i sistemnyj analiz. № 2.
 Shor N.Z. (1979): Metody minimizatsii nedifferentsiruemykh funktsij i ikh prilozheniya. Kiev: Naukova dumka.
 Brodlie K. (1972): An Assement of Two Aapproaches to Variable Metric Methods // Math. Program. Vol. 7. № 12.
 Lemarechal C., Nemirovskii A., Nesterov Yu. (1995): New Variants of Bundle Methods // Math. Program. Seria B. Vol. 69. № 1.
 Lemarechal C. (1974): An Algorithm for Minimizing Convex Functions. In: “Proceedings of IFIP Congress”. NorthHolland, Amsterdam.
 Lemarechal C. (1982): Numerical Experiments in Nonsmoth Optimization. In: “Progress in Nondifferentiable Optimization”. Luxenburg: IIASA-report.
 Wolfe P. (1974): Note on a Method of Conjugate Subgradients for Minimizing Nondifferentiable Functions // Math. Program. Vol. 7. № 3.

Comments

No posts found

Write a review
Translate