Difference of convex solution of quadratically constrained optimization problems

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.148, Iss.2, 2003-07, pp. : 349-362

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Quadratically constrained convex quadratic programmes: faulty feasible regions

By Caron R.J. Obuchowska W.T.

European Journal of Operational Research, Vol. 94, Iss. 1, 1996-10 ,pp. : 134-142

Elsevier

Access to resources Recommend Favorite

A tractable approximation of non-convex chance constrained optimization with non-Gaussian uncertainties

Engineering Optimization, Vol. 47, Iss. 4, 2015-04 ,pp. : 495-520

Taylor & Francis Ltd

Access to resources Recommend Favorite

Solving constrained optimization problems with hybrid particle swarm optimization

By Zahara Erwie Hu Chia-Hsin

Engineering Optimization, Vol. 40, Iss. 11, 2008-11 ,pp. : 1031-1049

Taylor & Francis Ltd

Access to resources Recommend Favorite

Exact solution methods for uncapacitated location problems with convex transportation costs

By Holmberg K.

European Journal of Operational Research, Vol. 114, Iss. 1, 1999-04 ,pp. : 127-140

Elsevier

Access to resources Recommend Favorite

Improving complexity of structured convex optimization problems using self-concordant barriers

By Glineur F.

European Journal of Operational Research, Vol. 143, Iss. 2, 2002-12 ,pp. : 291-310

Elsevier

Access to resources Recommend Favorite