A computational analysis of LCP methods for bilinear and concave quadratic programming

Authors:
J. J. Júdice;A. M. Faustino
Affiliations:
-;-
Venue:
Computers and Operations Research
Year:
1991

Citing 0
Cited 2

Accelerating convergence of cutting plane algorithms for disjoint bilinear programming

Journal of Global Optimization
A bilinear formulation for vector sparsity optimization

Signal Processing

Quantified Score

Hi-index	0.01

Visualization

Abstract