|
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 2010, Volume 50, Number 5, Pages 832–835
(Mi zvmmf4873)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
Iterative algorithm for mathematical programming problems with preconvex constraints
T. F. Minnibaev, Yu. A. Chernyaev Kazan State Technical University, ul. K. Marksa 10, Kazan, 420111 Tatarstan, Russia
Abstract:
An iterative algorithm is proposed for minimizing a convex function on a set defined as the set-theoretic difference between a convex set and the union of several convex sets. The convergence of the algorithm is proved in terms of necessary conditions for a local minimum.
Key words:
preconvex set, convex programming problem, necessary condition for a local minimum, convergence of an iterative algorithm.
Received: 12.01.2009
Citation:
T. F. Minnibaev, Yu. A. Chernyaev, “Iterative algorithm for mathematical programming problems with preconvex constraints”, Zh. Vychisl. Mat. Mat. Fiz., 50:5 (2010), 832–835; Comput. Math. Math. Phys., 50:5 (2010), 792–794
Linking options:
https://www.mathnet.ru/eng/zvmmf4873 https://www.mathnet.ru/eng/zvmmf/v50/i5/p832
|
|