Duality and sensitivity in nonconvex quadratic optimization over an ellipsoid

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.94, Iss.1, 1996-10, pp. : 167-178

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

A simple duality proof in convex quadratic programming with a quadratic constraint, and some applications

By Pinar M.C.

European Journal of Operational Research, Vol. 124, Iss. 1, 2000-07 ,pp. : 151-158

Elsevier

Access to resources Recommend Favorite

A global optimization method for nonconvex separable programming problems

By Li H.-L. Yu C.-S.

European Journal of Operational Research, Vol. 117, Iss. 2, 1999-09 ,pp. : 275-292

Elsevier

Access to resources Recommend Favorite

Developments in global optimization: Nonconvex optimization and its Applications, Vol. 18

By Jansen B.

European Journal of Operational Research, Vol. 107, Iss. 1, 1998-05 ,pp. : 245-245

Elsevier

Access to resources Recommend Favorite

A note on lack of strong duality for quadratic problems with orthogonal constraints

By Wolkowicz H.

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

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