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. Audience: The book will serve as a fundamental reference book for all those who are interested in mathematical optimization.

The authors have written a rigorous yet elementary and self-contained book to present, in a unified framework, generalized convex functions. The book also includes numerous exercises and two appendices which list the findings consulted.

The relentless growth of data in financial markets has boosted the demand for more advanced analytical tools to facilitate and improve financial planning. The ability to constructively use this data is limited for managers and investors without the proper theoretical support. Within this context, there is an unmet demand for combining analytical finance methods with business analytics topics to inform better investment decisions. Advancement in Business Analytics Tools for Higher Financial Performance explores the financial applications of business analytics tools that can help financial managers and investors to better understand financial theory and improve institutional investment practices. This book explores the value extraction process using more accurate financial data via business analytical tools to help investors and portfolio managers develop more modern financial planning processes. Covering topics such as financial markets, investment analysis, and statistical tools, this book is ideal for accountants, data analysts, researchers, students, business professionals, academicians, and more.

This book presents a new approach to global non-convex constrained optimization. Problem dimensionality is reduced via space-filling curves. To economize the search, constraint is accounted separately (penalties are not employed). The multicriteria case is also considered. All techniques are generalized for (non-redundant) execution on multiprocessor systems. Audience: Researchers and students working in optimization, applied mathematics, and computer science.

The theory of convex optimization has been constantly developing over the past 30 years. Most recently, many researchers have been studying more complicated classes of problems that still can be studied by means of convex analysis, so-called "anticonvex" and "convex-anticonvex" optimizaton problems. This manuscript contains an exhaustive presentation of the duality for these classes of problems and some of its generalization in the framework of abstract convexity. This manuscript will be of great interest for experts in this and related fields.

There has been much recent progress in approximation algorithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. In discrete (or combinatorial) optimization many approaches have been developed recently that link the discrete universe to the continuous universe through geomet ric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. As a result new ap proximate algorithms have been discovered and many new computational approaches have been developed. Similarly, for many continuous nonconvex optimization prob lems, new approximate algorithms have been developed based on semidefinite pro gramming and new randomization techniques. On the other hand, computational complexity, originating from the interactions between computer science and numeri cal optimization, is one of the major theories that have revolutionized the approach to solving optimization problems and to analyzing their intrinsic difficulty. The main focus of complexity is the study of whether existing algorithms are efficient for the solution of problems, and which problems are likely to be tractable. The quest for developing efficient algorithms leads also to elegant general approaches for solving optimization problems, and reveals surprising connections among problems and their solutions. A conference on Approximation and Complexity in Numerical Optimization: Con tinuous and Discrete Problems was held during February 28 to March 2, 1999 at the Center for Applied Optimization of the University of Florida.

Nonsmooth and nonconvex models arise in several important applications of mechanics and engineering. The interest in this field is growing from both mathematicians and engineers. The study of numerous industrial applications, including contact phenomena in statics and dynamics or delamination effects in composites, require the consideration of nonsmoothness and nonconvexity. The mathematical topics discussed in this book include variational and hemivariational inequalities, duality, complementarity, variational principles, sensitivity analysis, eigenvalue and resonance problems, and minimax problems. Applications are considered in the following areas among others: nonsmooth statics and dynamics, stability of quasi- static evolution processes, friction problems, adhesive contact and debonding, inverse problems, pseudoelastic modeling of phase transitions, chaotic behavior in nonlinear beams, and nonholonomic mechanical systems. This volume contains 22 chapters written by various leading researchers and presents a cohesive and authoritative overview of recent results and applications in the area of nonsmooth and nonconvex mechanics. Audience: Faculty, graduate students, and researchers in applied mathematics, optimization, control and engineering.

This book deals with the theory and applications of the Reformulation- Linearization/Convexification Technique (RL T) for solving nonconvex optimization problems. A unified treatment of discrete and continuous nonconvex programming problems is presented using this approach. In essence, the bridge between these two types of nonconvexities is made via a polynomial representation of discrete constraints. For example, the binariness on a 0-1 variable x . can be equivalently J expressed as the polynomial constraint x . (1-x . ) = 0. The motivation for this book is J J the role of tight linear/convex programming representations or relaxations in solving such discrete and continuous nonconvex programming problems. The principal thrust is to commence with a model that affords a useful representation and structure, and then to further strengthen this representation through automatic reformulation and constraint generation techniques. As mentioned above, the focal point of this book is the development and application of RL T for use as an automatic reformulation procedure, and also, to generate strong valid inequalities. The RLT operates in two phases. In the Reformulation Phase, certain types of additional implied polynomial constraints, that include the aforementioned constraints in the case of binary variables, are appended to the problem. The resulting problem is subsequently linearized, except that certain convex constraints are sometimes retained in XV particular special cases, in the Linearization/Convexijication Phase. This is done via the definition of suitable new variables to replace each distinct variable-product term. The higher dimensional representation yields a linear (or convex) programming relaxation.