Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/26912
Title: Hidden convex minimization
Authors: Li, D
Wu, ZY
Lee, HWJ 
Yang, XM
Zhang, LS
Keywords: Convex optimization
Convexification
Global optimization
Hidden convex optimization
Nonconvex optimization
Issue Date: 2005
Publisher: Springer
Source: Journal of global optimization, 2005, v. 31, no. 2, p. 211-233 How to cite?
Journal: Journal of global optimization 
Abstract: A class of nonconvex minimization problems can be classified as hidden convex minimization problems. A nonconvex minimization problem is called a hidden convex minimization problem if there exists an equivalent transformation such that the equivalent transformation of it is a convex minimization problem. Sufficient conditions that are independent of transformations are derived in this paper for identifying such a class of seemingly nonconvex minimization problems that are equivalent to convex minimization problems. Thus a global optimality can be achieved for this class of hidden convex optimization problems by using local search methods. The results presented in this paper extend the reach of convex minimization by identifying its equivalent with a nonconvex representation.
URI: http://hdl.handle.net/10397/26912
ISSN: 0925-5001
EISSN: 1573-2916
DOI: 10.1007/s10898-004-5697-5
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

10
Last Week
0
Last month
0
Citations as of Dec 7, 2018

WEB OF SCIENCETM
Citations

9
Last Week
0
Last month
0
Citations as of Dec 15, 2018

Page view(s)

216
Last Week
0
Last month
Citations as of Dec 17, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.