Journal
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS
Volume 48, Issue 2, Pages 225-241Publisher
PLEIADES PUBLISHING INC
DOI: 10.1134/S0965542508020061
Keywords
nonconvex optimization; bilinear programming; test problem generation; local search; critical point; stopping rule; global search; numerical experiment
Categories
Funding
- Russian Foundation for Basic Research [05-01-00110]
- President of the Russian Federation [MK-6580.2006.1]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
