Springer, 2025. — 577 p. This book presents a comprehensive series of methods in nonsmooth optimization, with a particular focus on their application in stochastic programming and dedicated algorithms for decision-making under uncertainty. Each method is accompanied by rigorous mathematical analysis, ensuring a deep understanding of the underlying principles. The theoretical...
Springer, 2025. — 798 p. Preface Metaheuristics, Theory and Applications Multilevel Thresholding Color Image Segmentation Solved with Metaheuristics Optimization and Improve Image Contrast: A Comparative Study of Classical Metaheuristic Algorithms Grouping and Partitioning Methods in Metaheuristic Algorithms Image Contrast Enhancement: Harnessing Metaheuristics and the Gauss...
De Gruyter, 2025. — 644 p. The book presents powerful optimization approaches for integrating Artificial Intelligence (AI) into daily life. This book explores how heuristic and metaheuristic methodologies have revolutionized the fields of robotics and Machine Learning (ML). The book covers the wide range of tools and methods that have emerged as part of the AI revolution, from...
Intelliz Press, 2024. — 270 p. Optimization methods have become increasingly crucial across various domains, serving as indispensable tools for addressing real-world challenges. These algorithms continuously evolve to produce high-quality solutions in a reasonable timeframe. Metaheuristic methods, inspired by the behavior of populations or swarms in nature, are particularly...
Springer, 2024. — 420 p. This book studies a general class of convex stochastic optimization (CSO) problems that unifies many common problem formulations from operations research, financial mathematics and stochastic optimal control. We extend the theory of dynamic programming and convex duality to allow for a unified and simplified treatment of various special problem classes...
Basel: Birkhäuser, 2024. — 173 p. This textbook gives an introduction to optimization tools which arise around the Weierstrass theorem about the minimum of a lower semicontinuous function. Starting from a Euclidean space, it moves further into the infinite dimensional setting towards the direct variational method, going through differentiation and introducing relevant...
Springer, 2024. — 173 p. In recent years, non-linear optimization has had a crucial role in the development of modern techniques at the interface of Machine Learning and imaging. The present book is a collection of recent contributions in the field of optimization, either revisiting consolidated ideas to provide formal theoretical guarantees or providing comparative numerical...
Springer, 2024. — 316 p. This book offers a self-contained introduction to the world of robust combinatorial optimization. It explores decision-making using the min-max and min-max regret criteria, while also delving into the two-stage and recoverable robust optimization paradigms. It begins by introducing readers to general results for interval, discrete, and budgeted...
IGI Global, 2024. — 423 p. In contemporary engineering domains, optimization and decision-making issues are crucial. Given the vast amounts of available data, processing times and memory usage can be substantial. Developing and implementing novel heuristic algorithms is time-consuming, yet even minor improvements in solutions can significantly reduce computational costs. In...
Academic Press, 1993. — 424 p. — (Mathematics in science and engineering, 193). Preface Notation Abstract Quasimotions and their Properties Reference Information Piecewise-Continuous Stepwise Quasimotion The Alternative and the Saddle Point Corollaries of the Alternative Slater Optimality Slater-Maximal Strategy Sufficient Conditions Structure in the Case of Slater Optimality...
Springer, 2024. — 1406 p. The formal optimization handbook is a comprehensive guide that covers a wide range of subjects. It includes a literature review, a mathematical formulation of optimization methods, flowcharts and pseudocodes, illustrations, problems and applications, results and critical discussions, and much more. The book covers a vast array of formal optimization...
Springer, 2024. — 789 p. This monograph explores key principles in the modern theory of dynamic optimization, incorporating important advances in the field to provide a comprehensive, mathematically rigorous reference. Emphasis is placed on nonsmooth analytic techniques, and an in-depth treatment of necessary conditions, minimizer regularity, and global optimality conditions...
Springer, 2023. — 149 p. This book presents a short introduction to the main tools of optimization methodology including linear programming, steepest descent, conjugate gradients, and the Karush-Kuhn-Tucker-John conditions. Each topic is developed in terms of a specific physical model, so that the strategy behind every step is motivated by a logical, concrete, easily visualized...
Springer, 2024. — 369 p. This textbook comprehensively explores the foundational principles, algorithms, and applications of intelligent optimization, making it an ideal resource for both undergraduate and postgraduate artificial intelligence courses. It remains equally valuable for active researchers and individuals engaged in self-study. Serving as a significant reference, it...
М.: Радио и связь, 1981. — 112 с. Книга посвящена задачам распределения ресурсов на сетевых графиках и транспортных сетях. Рассмотрены как детерминированный случай, так и случай, когда имеются неопределенные факторы или противник. В конечном итоге все задачи сводятся к задачам нелинейного программирования. Книга будет полезна научным работникам и инженерам, занимающимся...
Engineering Science Reference, 2024. — 308 p. In the relentless battle against escalating cyber threats, data security faces a critical challenge – the need for innovative solutions to fortify encryption and decryption processes. The increasing frequency and complexity of cyber-attacks demand a dynamic approach, and this is where the intersection of cryptography and machine...
Wiley-ISTE, 2021. — 254 p. This book provides easy access to the basic principles and methods for solving constrained and unconstrained convex optimization problems. Included are sections that cover: basic methods for solving constrained and unconstrained optimization problems with differentiable objective functions; convex sets and their properties; convex functions and their...
SIAM, 2024. — 192 p. This concise, self-contained volume introduces convex analysis and optimization algorithms, with an emphasis on bridging the two areas. It explores cutting-edge algorithms-such as the proximal gradient, Douglas-Rachford, Peaceman-Rachford, and FISTA-that have applications in machine learning, signal processing, image reconstruction, and other fields. An...
Cham: Springer Nature Switzerland, 2024. — 297 p. This text focuses on simple and easy-to-use design strategies for solving complex engineering problems that arise in several fields of engineering design, namely non-convex optimization problems. The main optimization tool used in this book to tackle the problem of nonconvexity is the Heuristic Kalman Algorithm (HKA). The main...
Springer, 2023. — 350 p. This book demonstrates the metaheuristic methodologies that apply to maximum diversity problems to solve them. Maximum diversity problems arise in many practical settings from facility location to social network analysis and constitute an important class of NP-hard problems in combinatorial optimization. In fact, this volume presents a “missing link” in...
Springer, 2024. — 129 p. Written by an experienced operations research practitioner with a strong applied mathematics background, this book offers practical insights into how to approach optimization problems, how to develop intelligent and efficient mathematical models and algorithms, and how to implement and deliver software products to customers. With a focus on revealing...
Englewood Cliffs: Prentice-Hall, 1982. — 244 p. Designed both for those who seek an acquaintance with dynamic programming and for those wishing to become experts, this text is accessible to anyone who's taken a course in operations research. It starts with a basic introduction to sequential decision processes and proceeds to the use of dynamic programming in studying models of...
Technion, Georgia Institute of Technology, 2023. — 732 p. Main Notational Conventions From Linear to Conic Programming Linear programming: basic notions Duality in Linear Programming Certificates for solvability and insolvability Dual to an LP program: the origin The LP Duality Theorem Selected Engineering Applications of LP Sparsity-oriented Signal Processing and 1...
Technion, Georgia Institute of Technology, 2023. — 341 p. Convex sets in Rn Definition and basic properties A convex set Examples of convex sets Affine subspaces and polyhedral sets Unit balls of norms Ellipsoids Neighbourhood of a convex set Inner description of convex sets: Convex combinations and convex hull Convex combinations Convex hull Simplex Cones Calculus of convex...
Wiley-ISTE, 2012. — 328 p. The purpose of this book is to present the main methods of static and dynamic optimization. It has been written within the framework of the European Union project – ERRIC (Empowering Romanian Research on Intelligent Information Technologies), funded by the EU’s FP7 Research Potential program and developed in cooperation between French and Romanian...
Springer, 2021. — 126 p. The book is intended for graduate students and researchers in mathematics, computer science, and operational research. The book presents a new derivative-free optimization method/algorithm based on randomly generated trial points in specified domains and where the best ones are selected at each iteration by using a number of rules. This method is...
Монография. — Новосибирск: Наука, 2003. — 325 с. В монографии представлены примеры практических задач невыпуклой оптимизации, классификация и мотивация изучения невыпуклых задач. Дано единое изложение теории экстремума для невыпуклых задач оптимизации. Разработана новая методология решения невыпуклых задач математического программирования. Рассмотрены основные свойства...
Учебное пособие. — М.: Московский государственный университет (МГУ) имени М.В. Ломоносова, 1996. — 76 с. Экстремальные задачи формулируются как задачи отыскания максимального или минимального значения функции или функционала J(u) на заданном множестве 𝒰 некоторого пространства. Со значением функции J(u) часто связывают цену (или качество) управления, а аргумент u задает само...
EDP Sciences, 2023. — 476 p. This book in two volumes provides an overview of continuous, discrete and functional optimization techniques. This second volume is devoted to discrete optimization (problems with integer variables) and functional optimization (problems where the unknown is a function). The topics covered are: • mixed linear programming: cutting methods and tree...
EDP Sciences, 2023. — 482 p. This book in two volumes provides an overview of continuous, discrete and functional optimization techniques. This first volume is devoted to continuous optimization, which deals with problems with real variables, without or with constraints. After a reminder of the optimality conditions and their geometrical interpretation, the topics covered...
Springer, 2024. — 280 p. Preface Introduction to Metaheuristic Schemes: Characteristics, Properties, and Importance in Solving Optimization Problems Exploring the Potential of Agent Systems for Metaheuristics Appendix 1 Functions Used in the Experiments Appendix 2 Engineering Design Problems Dynamic Multimodal Function Optimization: An Evolutionary-Mean Shift Approach...
Springer, 2022. — 323 p. Preface Contributors Acronyms Introduction to QUBO Applications and Computational Advances for Solving the QUBO Model Complexity and Polynomially Solvable Special Cases of QUBO The Boolean Quadric Polytope Autarkies and Persistencies for QUBO Mathematical Programming Models and Exact Algorithms The Random QUBO Fast Heuristics and Approximation...
Springer, 1998. — 233 p. A crucial step in making decisions of a quantitative nature requires the solution of optimization problems. Such optimization problems can be described as minimizing or maximizing an objective function subject to a family of constraints. The choice of which functions to use as an objective function and as constraints depends on the modeling of the...
Berlin: Logos Verlag Berlin, 2016. — 124 p. We consider expensive optimization problems, that is to say problems where each evaluation of the objective function is expensive in terms of computing time, consumption of resources, or cost. This often happens in situations where the objective function is not available in analytic form, e.g. crash tests, best composition of...
Springer, 2021. — 91 p. The book addresses the minimization of special lower semicontinuous functionals over closed balls in metric spaces, called the approximate variation. The new notion of approximate variation contains more information about the bounded variation functional and has the following features: the infimum in the definition of approximate variation is not...
Hoboken: Wiley, 2016. — 481 p. Robust Optimization is a method to improve robustness using low-cost variations of a single, conceptual design. The benefits of Robust Optimization include faster product development cycles; faster launch cycles; fewer manufacturing problems; fewer field problems; lower-cost, higher performing products and processes; and lower warranty costs. All...
Springer, 2023. — 293 p. Preface Heuristics and Metaheuristics Book Structure Source Codes for the Traveling Salesman Problem Exercises Acknowledgements Combinatorial Optimization, Complexity Theory, and Problem Modeling Elements of Graphs and Complexity Theory A Short List of Combinatorial Optimization Problems Problem Modeling Basic Heuristic Techniques Local Search...
Springer, 2023. — 113 p. This book provides a series of systematic theoretical results and numerical solution algorithms for dynamic optimization problems of switched systems within infinite-dimensional inequality path constraints. Dynamic optimization of path-constrained switched systems is a challenging task due to the complexity from seeking the best combinatorial...
Cham: Springer, 2023. — 451 p. This book aims at an innovative approach within the framework of convex analysis and optimization, based on an in-depth study of the behavior and properties of the supremum of families of convex functions. It presents an original and systematic treatment of convex analysis, covering standard results and improved calculus rules in subdifferential...
New Delhi: Springer-HBA, 2023. — 148 p. This book develops the concepts of fundamental convex analysis and optimization by using advanced calculus and real analysis. Brief accounts of advanced calculus and real analysis are included within the book. The emphasis is on building a geometric intuition for the subject, which is aided further by supporting figures. Two...
Учебное пособие. — Пермь: Пермский государственный университет (ПГУ), 2005. — 195 с. — ISBN 5-7944-0565-1. В учебном пособии рассматриваются задачи теории оптимального управления линейными динамическими объектами. В частности, подробно исследован случай управления с терминальным критерием качества и случай управления по критерию предельного быстродействия. Изучается возможность...
Учебное пособие. — Пермь: Пермский государственный университет (ПГУ), 2004. — 128 с. В учебном пособии рассматриваются линейные задачи оптимизации в конечномерных пространствах, обычно называемые задачами линейного программирования. Приводятся основные типы прикладных задач линейного программирования, описывается графический и симплекс-методы их решения, развивается теория...
Singapore: Springer, 2023. — 266 p. This edited book provides a platform to discuss the state-of-the-art developments associated with traditional and advanced single-/multi-objective criteria optimization methods for addressing problems of performance enhancement of the products and systems design. The book in detail discusses the core ideas, underlying principles, mathematical...
Singapore: Springer, 2021. — 134 p. This book discusses comprehensively the advanced manufacturing processes, including illustrative examples of the processes, mathematical modeling, and the need to optimize associated parameter problems. In addition, it describes in detail the cohort intelligence methodology and its variants along with illustrations, to help readers gain a...
Cham: Springer, 2022. — 128 p. This brief explores the Krasnosel'skiĭ-Man (KM) iterative method, which has been extensively employed to find fixed points of nonlinear methods. Preface Introduction Fixed Point Iteration Procedures Fixed Point Formulation of Typical Problems Outline Notation and Mathematical Foundations The Krasnosel'skiĭ–Mann Iteration The Original...
Waveland Pr Inc., 1999. — 332 p. In this volume Dr. Chiang introduces readers to the most important methods of dynamic optimization used in economics. The classical calculus of variations, optimal control theory, and dynamic programming in its discrete form are explained in the usual Chiang fashion--with patience and thoroughness. The economic examples, selected from both...
Berlin: Springer, 1992. — 188 p. This volume includes a selection of refereed papers presented at the GAMM/IFIP-Workshop on "Stochastic Optimization: Numerical Methods and Technical Applications", held at the Federal Armed Forces University Munich,May 29 - 31, 1990. The objective of this meeting was to bring together scientists from Stochastic Programming and from those...
Springer, 2001. — 438 p. This edited book is dedicated to Professor N. U. Ahmed, a leading scholar and a renowned researcher in optimal control and optimization on the occasion of his retirement from the Department of Electrical Engineering at University of Ottawa in 1999. The contributions of this volume are in the areas of optimal control, non linear optimization and...
Springer, 2004. — 276 p. This volume is an introduction to the theory of shortest connectivity, as the core of the so-called "Geometric Network Design Problems", where the general problem can be stated as follows: given a configuration of vertices and/or edges, find a network which contains these objects, satisfies some predetermined requirements, and which minimizes a given...
Academic Press/Elsevier, 2023. — 298 p. Studies on integer optimization in emergency management have attracted engineers and scientists from various disciplines such as management, mathematics, computer science, and other fields. Although there are a large number of literature reports on integer planning and emergency events, few books systematically explain the combination of...