Author : Michael J. Best
Publisher : CRC Press
Page : 423 pages
File Size : 28,24 MB
Release : 2017-07-12
Category : Business & Economics
ISBN : 1351647202
Quadratic programming is a mathematical technique that allows for the optimization of a quadratic function in several variables. QP is a subset of Operations Research and is the next higher lever of sophistication than Linear Programming. It is a key mathematical tool in Portfolio Optimization and structural plasticity. This is useful in Civil Engineering as well as Statistics.
Author : Michael Jünger
Publisher : Springer Science & Business Media
Page : 317 pages
File Size : 47,48 MB
Release : 2001-11-21
Category : Mathematics
ISBN : 3540428771
This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality.
Author : Jean-Baptiste Hiriart-Urruty
Publisher : Springer Science & Business Media
Page : 362 pages
File Size : 13,64 MB
Release : 2013-03-14
Category : Business & Economics
ISBN : 366206409X
From the reviews: "The account is quite detailed and is written in a manner that will appeal to analysts and numerical practitioners alike...they contain everything from rigorous proofs to tables of numerical calculations.... one of the strong features of these books...that they are designed not for the expert, but for those who whish to learn the subject matter starting from little or no background...there are numerous examples, and counter-examples, to back up the theory...To my knowledge, no other authors have given such a clear geometric account of convex analysis." "This innovative text is well written, copiously illustrated, and accessible to a wide audience"
Author : Daniel Arnström
Publisher : Linköping University Electronic Press
Page : 45 pages
File Size : 42,16 MB
Release : 2021-03-03
Category :
ISBN : 9179296920
In model predictive control (MPC) an optimization problem has to be solved at each time step, which in real-time applications makes it important to solve these efficiently and to have good upper bounds on worst-case solution time. Often for linear MPC problems, the optimization problem in question is a quadratic program (QP) that depends on parameters such as system states and reference signals. A popular class of methods for solving such QPs is active-set methods, where a sequence of linear systems of equations is solved. The primary contribution of this thesis is a method which determines which sequence of subproblems a popular class of such active-set algorithms need to solve, for every possible QP instance that might arise from a given linear MPC problem (i.e, for every possible state and reference signal). By knowing these sequences, worst-case bounds on how many iterations, floating-point operations and, ultimately, the maximum solution time, these active-set algorithms require to compute a solution can be determined, which is of importance when, e.g, linear MPC is used in safety-critical applications. After establishing this complexity certification method, its applicability is extended by showing how it can be used indirectly to certify the complexity of another, efficient, type of active-set QP algorithm which reformulates the QP as a nonnegative least-squares method. Finally, the proposed complexity certification method is extended further to situations when enhancements to the active-set algorithms are used, namely, when they are terminated early (to save computations) and when outer proximal-point iterations are performed (to improve numerical stability).
Author : Michael J. Best
Publisher : CRC Press
Page : 238 pages
File Size : 27,58 MB
Release : 2010-03-09
Category : Mathematics
ISBN : 1420085840
Eschewing a more theoretical approach, Portfolio Optimization shows how the mathematical tools of linear algebra and optimization can quickly and clearly formulate important ideas on the subject. This practical book extends the concepts of the Markowitz "budget constraint only" model to a linearly constrained model. Only requiring elementary linear algebra, the text begins with the necessary and sufficient conditions for optimal quadratic minimization that is subject to linear equality constraints. It then develops the key properties of the efficient frontier, extends the results to problems with a risk-free asset, and presents Sharpe ratios and implied risk-free rates. After focusing on quadratic programming, the author discusses a constrained portfolio optimization problem and uses an algorithm to determine the entire (constrained) efficient frontier, its corner portfolios, the piecewise linear expected returns, and the piecewise quadratic variances. The final chapter illustrates infinitely many implied risk returns for certain market portfolios. Drawing on the author’s experiences in the academic world and as a consultant to many financial institutions, this text provides a hands-on foundation in portfolio optimization. Although the author clearly describes how to implement each technique by hand, he includes several MATLAB® programs designed to implement the methods and offers these programs on the accompanying CD-ROM.
Author : Jean-Baptiste Hiriart-Urruty
Publisher : Springer Science & Business Media
Page : 432 pages
File Size : 11,65 MB
Release : 2013-03-09
Category : Mathematics
ISBN : 3662027968
Convex Analysis may be considered as a refinement of standard calculus, with equalities and approximations replaced by inequalities. As such, it can easily be integrated into a graduate study curriculum. Minimization algorithms, more specifically those adapted to non-differentiable functions, provide an immediate application of convex analysis to various fields related to optimization and operations research. These two topics making up the title of the book, reflect the two origins of the authors, who belong respectively to the academic world and to that of applications. Part I can be used as an introductory textbook (as a basis for courses, or for self-study); Part II continues this at a higher technical level and is addressed more to specialists, collecting results that so far have not appeared in books.
Author : Michael Patriksson
Publisher : Springer Science & Business Media
Page : 343 pages
File Size : 44,3 MB
Release : 2013-06-29
Category : Mathematics
ISBN : 147572991X
Since I started working in the area of nonlinear programming and, later on, variational inequality problems, I have frequently been surprised to find that many algorithms, however scattered in numerous journals, monographs and books, and described rather differently, are closely related to each other. This book is meant to help the reader understand and relate algorithms to each other in some intuitive fashion, and represents, in this respect, a consolidation of the field. The framework of algorithms presented in this book is called Cost Approxi mation. (The preface of the Ph.D. thesis [Pat93d] explains the background to the work that lead to the thesis, and ultimately to this book.) It describes, for a given formulation of a variational inequality or nonlinear programming problem, an algorithm by means of approximating mappings and problems, a principle for the update of the iteration points, and a merit function which guides and monitors the convergence of the algorithm. One purpose of this book is to offer this framework as an intuitively appeal ing tool for describing an algorithm. One of the advantages of the framework, or any reasonable framework for that matter, is that two algorithms may be easily related and compared through its use. This framework is particular in that it covers a vast number of methods, while still being fairly detailed; the level of abstraction is in fact the same as that of the original problem statement.
Author : Philip E. Gill
Publisher :
Page : 48 pages
File Size : 11,63 MB
Release : 1988
Category : Quadratic programming
ISBN :
We also derive recurrance relations that facilitate the efficient implementation of a class of inertia-controlling methods that maintain the factorization of a nonsingular matrix associated with the Karush-Kuhn-Tucker conditions."
Author : John B. Guerard, Jr.
Publisher : Springer Science & Business Media
Page : 796 pages
File Size : 43,33 MB
Release : 2009-12-12
Category : Business & Economics
ISBN : 0387774394
Portfolio construction is fundamental to the investment management process. In the 1950s, Harry Markowitz demonstrated the benefits of efficient diversification by formulating a mathematical program for generating the "efficient frontier" to summarize optimal trade-offs between expected return and risk. The Markowitz framework continues to be used as a basis for both practical portfolio construction and emerging research in financial economics. Such concepts as the Capital Asset Pricing Model (CAPM) and the Arbitrage Pricing Theory (APT), for example, provide the foundation for setting benchmarks, for predicting returns and risk, and for performance measurement. This volume showcases original essays by some of today’s most prominent academics and practitioners in the field on the contemporary application of Markowitz techniques. Covering a wide spectrum of topics, including portfolio selection, data mining tests, and multi-factor risk models, the book presents a comprehensive approach to portfolio construction tools, models, frameworks, and analyses, with both practical and theoretical implications.
Author : Christodoulos A. Floudas
Publisher : Princeton University Press
Page : 644 pages
File Size : 14,47 MB
Release : 2014-07-14
Category : Mathematics
ISBN : 1400862523
This book will present the papers delivered at the first U.S. conference devoted exclusively to global optimization and will thus provide valuable insights into the significant research on the topic that has been emerging during recent years. Held at Princeton University in May 1991, the conference brought together an interdisciplinary group of the most active developers of algorithms for global optimization in order to focus the attention of the mathematical programming community on the unsolved problems and diverse applications of this field. The main subjects addressed at the conference were advances in deterministic and stochastic methods for global optimization, parallel algorithms for global optimization problems, and applications of global optimization. Although global optimization is primarily a mathematical problem, it is relevant to several other disciplines, including computer science, applied mathematics, physical chemistry, molecular biology, statistics, physics, engineering, operations research, communication theory, and economics. Global optimization problems originate from a wide variety of mathematical models of real-world systems. Some of its applications are allocation and location problems and VLSI and data-base design problems. Originally published in 1991. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.
