Numerical search for global solutions in problems of non-symmetric bilinear separability
A. V. Orlov
Institute for System Dynamics and Control Theory SB RAS, 134 Lermontov St., 664033 Irkutsk, Russia
The paper is devoted to the bilinear separability problem of two sets (the non-symmetrical case). The optimization approach to the problem is applied. This approach is based on the reduction of the bilinear separability problem to an equivalent nonconvex bilinear optimization problem with disjoint constraints. The latter problem is solved by Global Search Theory developed by A. S. Strekalovsky. According to that theory, the local and global search methods for the problem under scrutiny were elaborated. Computational testing of the developed methods has shown the competitive efficiency of the approach on a rather large number of test problems of bilinear separability. Ill. 5, tab. 3, bibliogr. 29.
classification problem, bilinear separability, optimization approach, local search, global search, test problem generation, numerical experiment.
PDF file (479 kB)
A. V. Orlov, “Numerical search for global solutions in problems of non-symmetric bilinear separability”, Diskretn. Anal. Issled. Oper., 22:1 (2015), 64–85
Citation in format AMSBIB
\paper Numerical search for global solutions in problems of non-symmetric bilinear separability
\jour Diskretn. Anal. Issled. Oper.
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|