Geometric Programming and Decomposition Techniques in Optimal Control
Title | Geometric Programming and Decomposition Techniques in Optimal Control PDF eBook |
Author | Supeno Djanali |
Publisher | |
Pages | 530 |
Release | 1984 |
Genre | Control theory |
ISBN |
Reduction and Decomposition of Large Generalized Geometric Programming Problems with Applications
Title | Reduction and Decomposition of Large Generalized Geometric Programming Problems with Applications PDF eBook |
Author | Elmer L. Peterson |
Publisher | |
Pages | 11 |
Release | 1974 |
Genre | |
ISBN |
The problems being attacked have to do with: (1) the optimal design and operation of mechanical and electrical devices, transportation networks, and hydraulic pipelines, (2) the optimal location of facilities, (3) the analysis and optimal design of structures, and (4) certain aspects of chemical equilibrium, regression analysis, and optimal control. Some of these problems have been modeled as 'geometric programming' problems. To obtain solutions to these and other geometric programming problems, methods that reduce the complexity of the total system have been (and continue to be) developed. These methods center around the ideas of 'decomposing' the total system into smaller subsystems and reducing the dimensionality of the overall system. Several papers based on these ideas have been accepted for publication and others are being prepared for publication. (Author).
Decomposition Techniques in Mathematical Programming
Title | Decomposition Techniques in Mathematical Programming PDF eBook |
Author | Antonio J. Conejo |
Publisher | Springer Science & Business Media |
Pages | 542 |
Release | 2006-04-28 |
Genre | Technology & Engineering |
ISBN | 3540276866 |
Optimization plainly dominates the design, planning, operation, and c- trol of engineering systems. This is a book on optimization that considers particular cases of optimization problems, those with a decomposable str- ture that can be advantageously exploited. Those decomposable optimization problems are ubiquitous in engineering and science applications. The book considers problems with both complicating constraints and complicating va- ables, and analyzes linear and nonlinear problems, with and without in- ger variables. The decomposition techniques analyzed include Dantzig-Wolfe, Benders, Lagrangian relaxation, Augmented Lagrangian decomposition, and others. Heuristic techniques are also considered. Additionally, a comprehensive sensitivity analysis for characterizing the solution of optimization problems is carried out. This material is particularly novel and of high practical interest. This book is built based on many clarifying, illustrative, and compu- tional examples, which facilitate the learning procedure. For the sake of cl- ity, theoretical concepts and computational algorithms are assembled based on these examples. The results are simplicity, clarity, and easy-learning. We feel that this book is needed by the engineering community that has to tackle complex optimization problems, particularly by practitioners and researchersinEngineering,OperationsResearch,andAppliedEconomics.The descriptions of most decomposition techniques are available only in complex and specialized mathematical journals, di?cult to understand by engineers. A book describing a wide range of decomposition techniques, emphasizing problem-solving, and appropriately blending theory and application, was not previously available.
Geometric Programming for Communication Systems
Title | Geometric Programming for Communication Systems PDF eBook |
Author | Mung Chiang |
Publisher | Now Publishers Inc |
Pages | 172 |
Release | 2005 |
Genre | Computers |
ISBN | 9781933019093 |
Recently Geometric Programming has been applied to study a variety of problems in the analysis and design of communication systems from information theory and queuing theory to signal processing and network protocols. Geometric Programming for Communication Systems begins its comprehensive treatment of the subject by providing an in-depth tutorial on the theory, algorithms, and modeling methods of Geometric Programming. It then gives a systematic survey of the applications of Geometric Programming to the study of communication systems. It collects in one place various published results in this area, which are currently scattered in several books and many research papers, as well as to date unpublished results. Geometric Programming for Communication Systems is intended for researchers and students who wish to have a comprehensive starting point for understanding the theory and applications of geometric programming in communication systems.
Geometric Programming for Design Equation Development and Cost/Profit Optimization (with illustrative case study problems and solutions), Third Edition
Title | Geometric Programming for Design Equation Development and Cost/Profit Optimization (with illustrative case study problems and solutions), Third Edition PDF eBook |
Author | Robert Creese |
Publisher | Springer Nature |
Pages | 194 |
Release | 2022-05-31 |
Genre | Technology & Engineering |
ISBN | 3031793765 |
Geometric Programming is used for cost minimization, profit maximization, obtaining cost ratios, and the development of generalized design equations for the primal variables. The early pioneers of geometric programming—Zener, Duffin, Peterson, Beightler, Wilde, and Phillips—played important roles in its development. Five new case studies have been added to the third edition. There are five major sections: (1) Introduction, History and Theoretical Fundamentals; (2) Cost Minimization Applications with Zero Degrees of Difficulty; (3) Profit Maximization Applications with Zero Degrees of Difficulty; (4) Applications with Positive Degrees of Difficulty; and (5) Summary, Future Directions, and Geometric Programming Theses & Dissertations Titles. The various solution techniques presented are the constrained derivative approach, condensation of terms approach, dimensional analysis approach, and transformed dual approach. A primary goal of this work is to have readers develop more case studies and new solution techniques to further the application of geometric programming.
Geometric-programming Solution of Optimal Control Problems
Title | Geometric-programming Solution of Optimal Control Problems PDF eBook |
Author | Supeno Djanali |
Publisher | |
Pages | 268 |
Release | 1978 |
Genre | Control theory |
ISBN |
Structure-Exploiting Numerical Algorithms for Optimal Control
Title | Structure-Exploiting Numerical Algorithms for Optimal Control PDF eBook |
Author | Isak Nielsen |
Publisher | Linköping University Electronic Press |
Pages | 202 |
Release | 2017-04-20 |
Genre | |
ISBN | 9176855287 |
Numerical algorithms for efficiently solving optimal control problems are important for commonly used advanced control strategies, such as model predictive control (MPC), but can also be useful for advanced estimation techniques, such as moving horizon estimation (MHE). In MPC, the control input is computed by solving a constrained finite-time optimal control (CFTOC) problem on-line, and in MHE the estimated states are obtained by solving an optimization problem that often can be formulated as a CFTOC problem. Common types of optimization methods for solving CFTOC problems are interior-point (IP) methods, sequential quadratic programming (SQP) methods and active-set (AS) methods. In these types of methods, the main computational effort is often the computation of the second-order search directions. This boils down to solving a sequence of systems of equations that correspond to unconstrained finite-time optimal control (UFTOC) problems. Hence, high-performing second-order methods for CFTOC problems rely on efficient numerical algorithms for solving UFTOC problems. Developing such algorithms is one of the main focuses in this thesis. When the solution to a CFTOC problem is computed using an AS type method, the aforementioned system of equations is only changed by a low-rank modification between two AS iterations. In this thesis, it is shown how to exploit these structured modifications while still exploiting structure in the UFTOC problem using the Riccati recursion. Furthermore, direct (non-iterative) parallel algorithms for computing the search directions in IP, SQP and AS methods are proposed in the thesis. These algorithms exploit, and retain, the sparse structure of the UFTOC problem such that no dense system of equations needs to be solved serially as in many other algorithms. The proposed algorithms can be applied recursively to obtain logarithmic computational complexity growth in the prediction horizon length. For the case with linear MPC problems, an alternative approach to solving the CFTOC problem on-line is to use multiparametric quadratic programming (mp-QP), where the corresponding CFTOC problem can be solved explicitly off-line. This is referred to as explicit MPC. One of the main limitations with mp-QP is the amount of memory that is required to store the parametric solution. In this thesis, an algorithm for decreasing the required amount of memory is proposed. The aim is to make mp-QP and explicit MPC more useful in practical applications, such as embedded systems with limited memory resources. The proposed algorithm exploits the structure from the QP problem in the parametric solution in order to reduce the memory footprint of general mp-QP solutions, and in particular, of explicit MPC solutions. The algorithm can be used directly in mp-QP solvers, or as a post-processing step to an existing solution.