期刊
APPLIED MATHEMATICS AND COMPUTATION
卷 255, 期 -, 页码 73-83出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.amc.2014.08.092
关键词
Difference of two convex functions; Local search; Linearized problems; Critical points
First, we consider a d.c. minimization problem with a simple feasible set and develop a special method based on the linearization with respect to the basic nonconvexity. The convergence of the methods is analyzed and compared with published results. Theoretical and practical stopping criteria are proposed. Second, we consider a problem with d.c. constraint and study the properties of special local search method for this problem. Finally, we consider a variant of local search for a general d.c. optimization problem and investigate its convergence. (C) 2014 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据