List of Titles

Authors: Wu, Zhiyou , Li, Duan , Zhang, Lian-Sheng
Date: 2011
Type: Text , Journal article
Relation: Journal of Global Optimization Vol. 50, no. 3 (2011), p. 379-3976
Full Text: false
Reviewed:
Description: We propose in this paper novel global descent methods for unconstrained global optimization problems to attain the global optimality by carrying out a series of local minimization. More specifically, the solution framework consists of a two-phase cycle of local minimization: the first phase implements local search of the original objective function, while the second phase assures a global descent of the original objective function in the steepest descent direction of a (quasi) global descent function. The key element of global descent methods is the construction of the (quasi) global descent functions which possess prominent features in guaranteeing a global descent. Â© 2010 Springer Science+Business Media, LLC.

Authors: Wu, Zhiyou , Li, Duan , Zhang, Lian-Sheng , Yang, Xin-Min
Date: 2007
Type: Text , Journal article
Relation: SIAM Journal on Optimization Vol. 18, no. 2 (2007), p. 507-536
Full Text: false
Reviewed:
Description: Convexity is, without a doubt, one of the most desirable features in optimization. Many optimization problems that are nonconvex in their original settings may become convex after performing certain equivalent transformations. This paper studies the conditions for such hidden convexity. More specifically, some transformation-independent sufficient conditions have been derived for identifying hidden convexity. The derived sufficient conditions are readily verifiable for quadratic optimization problems. The global minimizer of a hidden convex programming problem can be identified using a local search algorithm. © 2007 Society for Industrial and Applied Mathematics.
Description: C1
Description: 2003005616

Showing items 1 - 3 of 3