Beyond Convex? Global Optimization is Feasible Only for Convex Objective Functions: A Theorem

Author： Kreinovich Vladik   Kearfott R.  

Publisher： Springer Publishing Company

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.33, Iss.4, 2005-12, pp. : 617-624

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

PERT scheduling with convex cost functions

By Chretienne P.   Sourd F.  

Theoretical Computer Science, Vol. 292, Iss. 1, 2003-01 ,pp. : 145-164

Elsevier

Access to resources Recommend Favorite

Global Detection of Salient Convex Boundaries

By Wang Song   Stahl Joachim   Bailey Adam   Dropps Michael  

International Journal of Computer Vision, Vol. 71, Iss. 3, 2007-03 ,pp. : 337-359

Springer Publishing Company

Access to resources Recommend Favorite

An approximation algorithm for convex multi-objective programming problems

By Ehrgott Matthias  

Journal of Global Optimization, Vol. 50, Iss. 3, 2011-07 ,pp. : 397-416

Springer Publishing Company

Access to resources Recommend Favorite

Visualization of hypersurfaces and multivariable (objective) functions by partial global optimization

By Simionescu P.A.  

The Visual Computer, Vol. 20, Iss. 10, 2004-12 ,pp. : 665-681

Springer Publishing Company

Access to resources Recommend Favorite

Well-positioned Closed Convex Sets and Well-positioned Closed Convex Functions

By Adly Samir   Ernst Emil   Théra Michel  

Journal of Global Optimization, Vol. 29, Iss. 4, 2004-08 ,pp. : 337-351

Springer Publishing Company

Access to resources Recommend Favorite