On local search in d.c. optimization problems

Alexander S. Strekalovsky

Applied Mathematics and Computation, 2015, vol. 255, issue C, 73-83

Abstract: 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.

Keywords: Difference of two convex functions; Local search; Linearized problems; Critical points (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300314012028
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:255:y:2015:i:c:p:73-83

DOI: 10.1016/j.amc.2014.08.092

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().