Pages that link to "Item:Q2010088"
From MaRDI portal
The following pages link to A new algorithm for concave quadratic programming (Q2010088):
Displaying 6 items.
- A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues (Q2112679) (← links)
- New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming (Q2124794) (← links)
- Maximization of a PSD quadratic form and factorization (Q2230781) (← links)
- Robustness of Farrell cost efficiency measurement under data perturbations: evidence from a US manufacturing application (Q2239903) (← links)
- New bounds for nonconvex quadratically constrained quadratic programming (Q2689857) (← links)
- A generalized robust data envelopment analysis model based on directional distance function (Q6096583) (← links)
