首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Convex separable minimization with box constraints
Authors:Stefan M Stefanov
Institution:Department of Informatics, Neofit Rilski South-Western University, 66 Ivan Mihailov Str., 2700 Blagoevgrad, BULGARIA
Abstract:A minimization problem with convex separable objective function subject to a convex separable inequality constraint of the form “less than or equal to” and bounds on the variables (box constraints) is considered. Necessary and sufficient condition is proved for a feasible solution to be an optimal solution to this problem. An iterative algorithm of polynomial complexity for solving problems of the considered form is suggested and its convergence is proved. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)
Keywords:
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号