MathematicsEngineering

Variations and extension of the convex–concave procedure

Thomas Lipp, Stephen P. Boyd

2016.6.1OPTIMIZATION AND ENGINEERING

DOI: 10.1007/s11081-015-9294-x

tlooto Summary

This work investigates the convex–concave procedure, a local heuristic that utilizes the tools of convex optimization to find local optima of difference of conveX (DC) programming problems, and generalizes the algorithm to include vector inequalities.

Abstract

Abstract is not available.

Citation format

LIPP, Thomas; BOYD, Stephen P. Variations and extension of the convex–concave procedure. OPTIMIZATION AND ENGINEERING, 2016, 17: 263–287.