期刊
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS
卷 48, 期 2, 页码 225-241出版社
PLEIADES PUBLISHING INC
DOI: 10.1134/S0965542508020061
关键词
nonconvex optimization; bilinear programming; test problem generation; local search; critical point; stopping rule; global search; numerical experiment
资金
- Russian Foundation for Basic Research [05-01-00110]
- President of the Russian Federation [MK-6580.2006.1]
A bilinear programming problem with uncoupled variables is considered. First, a special technique for generating test bilinear problems is considered. Approximate algorithms for local and global search are proposed. Asymptotic convergence of these algorithms is analyzed, and stopping rules are proposed. In conclusion, numerical results for randomly generated bilinear problems are presented and analyzed.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据
分享论文
