Journal
APPLIED MATHEMATICS AND COMPUTATION
Volume 255, Issue -, Pages 73-83Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.amc.2014.08.092
Keywords
Difference of two convex functions; Local search; Linearized problems; Critical points
Categories
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available