
Summary: Two outer approximation algorithms for lower rank bilinear programming problems are developed. The first algorithm can generate an \(\varepsilon\)-optimal solution rather efficiently when the rank of the objective function is less than five. The second algorithm is exact and finitely convergent, yet with slower convergent property, compared to the first.
outer approximation algorithms, Quadratic programming, lower rank bilinear programming, \(\varepsilon\)-optimal solution
outer approximation algorithms, Quadratic programming, lower rank bilinear programming, \(\varepsilon\)-optimal solution
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
