Optimization on Low Rank Nonconvex Structures

Global optimization is one of the fastest developing fields in mathematical optimization. In fact, an increasing number of remarkably efficient deterministic algorithms have been proposed in the last ten years for solving several classes of large scale specially structured problems encountered in such areas as chemical engineering, financial engineering, location and network optimization, production and inventory control, engineering design, computational geometry, and multi-objective and multi-level optimization. These new developments motivated the authors to write a new book devoted to global optimization problems with special structures. Most of these problems, though highly nonconvex, can be characterized by the property that they reduce to convex minimization problems when some of the variables are fixed. A number of recently developed algorithms have been proved surprisingly efficient for handling typical classes of problems exhibiting such structures, namely low rank nonconvex structures.