Starting from where a first course in convex optimization leaves off, this text presents a unified analysis of first-order optimization methods – including parallel-distributed algorithms – through the abstraction of monotone operators. With the increased computational power and availability of big data over the past decade, applied disciplines have demanded that larger and larger optimization problems be solved. This text covers the first-order convex optimization methods that are uniquely effective at solving these large-scale optimization problems. Readers will have the opportunity to construct and analyze many well-known classical and modern algorithms using monotone operators, and walk away with a solid understanding of the diverse optimization algorithms. Graduate students and researchers in mathematical optimization, operations research, electrical engineering, statistics, and computer science will appreciate this concise introduction to the theory of convex optimization algorithms.

A high-impact factor, prestigious annual publication containing invited surveys by subject leaders: essential reading for all practitioners and researchers.

Convex optimization problems arise frequently in many different fields. This book provides a comprehensive introduction to the subject, and shows in detail how such problems can be solved numerically with great efficiency. The book begins with the basic elements of convex sets and functions, and then describes various classes of convex optimization problems. Duality and approximation techniques are then covered, as are statistical estimation techniques. Various geometrical problems are then presented, and there is detailed discussion of unconstrained and constrained minimization problems, and interior-point methods. The focus of the book is on recognizing convex optimization problems and then finding the most appropriate technique for solving them. It contains many worked examples and homework exercises and will appeal to students, researchers and practitioners in fields such as engineering, computer science, mathematics, statistics, finance and economics.

This volume collects the expanded notes of four series of lectures given on the occasion of the CIME course on Nonlinear Optimization held in Cetraro, Italy, from July 1 to 7, 2007. The Nonlinear Optimization problem of main concern here is the problem n of determining a vector of decision variables x ? R that minimizes (ma- n mizes) an objective function f(·): R ? R,when x is restricted to belong n to some feasible setF? R , usually described by a set of equality and - n n m equality constraints: F = {x ? R : h(x)=0,h(·): R ? R ; g(x) ? 0, n p g(·): R ? R }; of course it is intended that at least one of the functions f,h,g is nonlinear. Although the problem canbe stated in verysimpleterms, its solution may result very di?cult due to the analytical properties of the functions involved and/or to the number n,m,p of variables and constraints. On the other hand, the problem has been recognized to be of main relevance in engineering, economics, and other applied sciences, so that a great lot of e?ort has been devoted to develop methods and algorithms able to solve the problem even in its more di?cult and large instances. The lectures have been given by eminent scholars, who contributed to a great extent to the development of Nonlinear Optimization theory, methods and algorithms. Namely, they are: – Professor Immanuel M.

A collection of articles summarizing the state of knowledge in a large portion of modern homotopy theory. This welcome reference for many new results and recent methods is addressed to all mathematicians interested in homotopy theory and in geometric aspects of group theory.

In operations research and computer science it is common practice to evaluate the performance of optimization algorithms on the basis of computational results, and the experimental approach should follow accepted principles that guarantee the reliability and reproducibility of results. However, computational experiments differ from those in other sciences, and the last decade has seen considerable methodological research devoted to understanding the particular features of such experiments and assessing the related statistical methods. This book consists of methodological contributions on different scenarios of experimental analysis. The first part overviews the main issues in the experimental analysis of algorithms, and discusses the experimental cycle of algorithm development; the second part treats the characterization by means of statistical distributions of algorithm performance in terms of solution quality, runtime and other measures; and the third part collects advanced methods from experimental design for configuring and tuning algorithms on a specific class of instances with the goal of using the least amount of experimentation. The contributor list includes leading scientists in algorithm design, statistical design, optimization and heuristics, and most chapters provide theoretical background and are enriched with case studies. This book is written for researchers and practitioners in operations research and computer science who wish to improve the experimental assessment of optimization algorithms and, consequently, their design.

The Handbooks in Finance are intended to be a definitive source for comprehensive and accessible information in the field of finance. Each individual volume in the series presents an accurate self-contained survey of a sub-field of finance, suitable for use by finance and economics professors and lecturers, professional researchers, graduate students and as a teaching supplement. It is fitting that the series Handbooks in Finance devotes a handbook to Asset and Liability Management. Volume 2 focuses on applications and case studies in asset and liability management.The growth in knowledge about practical asset and liability modeling has followed the popularity of these models in diverse business settings. This volume portrays ALM in practice, in contrast to Volume 1, which addresses the theories and methodologies behind these models. In original articles practitioners and scholars describe and analyze models used in banking, insurance, money management, individual investor financial planning, pension funds, and social security. They put the traditional purpose of ALM, to control interest rate and liquidity risks, into rich and broad-minded frameworks. Readers interested in other business settings will find their discussions of financial institutions both instructive and revealing.* Focuses on pragmatic applications * Relevant to a variety of risk-management industries* Analyzes models used in most financial sectors

An insightful, concise, and rigorous treatment of the basic theory of convex sets and functions in finite dimensions, and the analytical/geometrical foundations of convex optimization and duality theory. Convexity theory is first developed in a simple accessible manner, using easily visualized proofs. Then the focus shifts to a transparent geometrical line of analysis to develop the fundamental duality between descriptions of convex functions in terms of points, and in terms of hyperplanes. Finally, convexity theory and abstract duality are applied to problems of constrained optimization, Fenchel and conic duality, and game theory to develop the sharpest possible duality results within a highly visual geometric framework. This on-line version of the book, includes an extensive set of theoretical problems with detailed high-quality solutions, which significantly extend the range and value of the book. The book may be used as a text for a theoretical convex optimization course; the author has taught several variants of such a course at MIT and elsewhere over the last ten years. It may also be used as a supplementary source for nonlinear programming classes, and as a theoretical foundation for classes focused on convex optimization models (rather than theory). It is an excellent supplement to several of our books: Convex Optimization Algorithms (Athena Scientific, 2015), Nonlinear Programming (Athena Scientific, 2017), Network Optimization(Athena Scientific, 1998), Introduction to Linear Optimization (Athena Scientific, 1997), and Network Flows and Monotropic Optimization (Athena Scientific, 1998).