Reverse convex problems: an approach based on optimality conditions.
Tseveendorj, Ider (2006)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Tseveendorj, Ider (2006)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Zhang, Jianguo, Xiao, Yunhai, Wei, Zengxin (2009)
Mathematical Problems in Engineering
Similarity:
Cheng, Wanyou, Zhang, Zongguo (2009)
Mathematical Problems in Engineering
Similarity:
El Mouatasim, Abdelkrim (2010)
Journal of Applied Mathematics
Similarity:
Abdelkrim El Mouatasim, Rachid Ellaia, José Souza de Cursi (2006)
International Journal of Applied Mathematics and Computer Science
Similarity:
We consider the global optimization of a nonsmooth (nondifferentiable) nonconvex real function. We introduce a variable metric descent method adapted to nonsmooth situations, which is modified by the incorporation of suitable random perturbations. Convergence to a global minimum is established and a simple method for the generation of suitable perturbations is introduced. An algorithm is proposed and numerical results are presented, showing that the method is computationally effective...
Zhao, Wenling, Zhang, Jing, Zhou, Jinchuan (2010)
Mathematical Problems in Engineering
Similarity:
Zhen-Jun Shi, Xiang-Sun Zhang, Jie Shen (2007)
RAIRO - Operations Research
Similarity:
In this paper, we propose a new class of adaptive trust region methods for unconstrained optimization problems and develop some convergence properties. In the new algorithms, we use the current iterative information to define a suitable initial trust region radius at each iteration. The initial trust region radius is more reasonable in the sense that the trust region model and the objective function are more consistent at the current iterate. The global convergence, super-linear and...
Li Sun, Guoping He, Yongli Wang, Changyin Zhou (2011)
Applications of Mathematics
Similarity:
A new algorithm for solving large scale bound constrained minimization problems is proposed. The algorithm is based on an accurate identification technique of the active set proposed by Facchinei, Fischer and Kanzow in 1998. A further division of the active set yields the global convergence of the new algorithm. In particular, the convergence rate is superlinear without requiring the strict complementarity assumption. Numerical tests demonstrate the efficiency and performance of the...
Wei, Z., Qi, L., Birge, J.R. (1998)
Journal of Inequalities and Applications [electronic only]
Similarity:
Zhang, Ming-Liang, Xiao, Yun-Hai, Zhou, Dangzhen (2010)
Mathematical Problems in Engineering
Similarity: