|
Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2006, Volume 12, Number 1, Pages 86–97
(Mi timm136)
|
|
|
|
This article is cited in 1 scientific paper (total in 2 paper)
Direct-dual Fejér methods for problems of quadratic programming
I. I. Eremin
Abstract:
The paper deals with the $S$-technology, which reduces convex problems of quadratic programming to the solution of systems of several linear, and one convex, inequalities. A certain variant of the Fejér method is applied to these systems. In particular, the problem of the constructive separability of convex polyhedral sets by a layer of maximal thickness is solved. This algorithm plays an important role in problems of discriminant analysis.
Received: 17.12.2005
Citation:
I. I. Eremin, “Direct-dual Fejér methods for problems of quadratic programming”, Dynamical systems: modeling, optimization, and control, Trudy Inst. Mat. i Mekh. UrO RAN, 12, no. 1, 2006, 86–97; Proc. Steklov Inst. Math. (Suppl.), 253, suppl. 1 (2006), S83–S95
Linking options:
https://www.mathnet.ru/eng/timm136 https://www.mathnet.ru/eng/timm/v12/i1/p86
|
Statistics & downloads: |
Abstract page: | 326 | Full-text PDF : | 117 | References: | 52 |
|