Search

This first book of conference proceedings contains selected papers presented at ICGEC 2023, the 15th International Conference on Genetic and Evolutionary Computing, held on October 6–8, 2023, in Kaohsiung, Taiwan. The conference is intended as an international forum for the researchers and professionals in all areas of genetic and evolutionary computing. And the readers know the up-to-date techniques of the mentioned topics, including swarm intelligence and its applications, operational technologies and networked multimedia applications, wearable computing and intelligent data hiding, image processing and intelligent applications, and intelligent multimedia tools and applications. It helps readers bring new ideas or apply the designed approaches from the collected papers to their professional jobs.

This book contains selected papers presented at ICGEC 2021, the 14th International Conference on Genetic and Evolutionary Computing, held from October 21-23, 2021 in Jilin City, China. The conference was technically co-sponsored by Springer, Northeast Electric Power University Fujian University of Technology, Shandong University of Science and Technology, and Western Norway University of Applied Sciences. It is intended as an international forum for the researchers and professionals in all areas of genetic and evolutionary computing. And the readers may learn the up-to-date techniques of the mentioned topics, including swarm intelligence, artificial intelligence, information hiding and data mining techniques, which can help them to bring new ideas or apply the designed approaches from the collected papers to their professional jobs.

This second volume of conference proceedings contains selected papers presented at ICGEC 2023, the 15th International Conference on Genetic and Evolutionary Computing, held on October 6-8, 2023 in Kaohsiung, Taiwan. The conference is intended as an international forum for the researchers and professionals in all areas of genetic and evolutionary computing. And the readers may know the up-to-date techniques of the mentioned topics, including technologies for next-generation network environments, recent progress in computational electromagnetic dynamics, future cyber security, privacy and forensics for advanced systems, data mining techniques and its applications, optimization models in deep learning and machine learning. It will help readers bring new ideas or apply the designed approaches from the collected papers to their professional jobs.

This book contains five essays on the complexity of continuous problems, written for a wider audience. Henryk Woźniakowski and the complexity of continuous problems Complexity as a new challenge for mathematicians A brief history of information-based complexity How high is high-dimensional? What is information-based complexity? The first four essays are based on talks presented in 2008 when Henryk Woźniakowski received an honorary doctoral degree of the Friedrich Schiller University of Jena. The focus is on introduction and history of the complexity of continuous problems, as well as on recent progress concerning the complexity of high-dimensional numerical problems. The last essay provides a brief and informal introduction to the basic notions and concepts of information-based complexity addressed to a general readership.

This book defines and studies a combinatorial object called the pedigree and develops the theory for optimising a linear function over the convex hull of pedigrees (the Pedigree polytope). A strongly polynomial algorithm implementing the framework given in the book for checking membership in the pedigree polytope is a major contribution.This book challenges the popularly held belief in computer science that a problem included in the NP-complete class may not have a polynomial algorithm to solve. By showing STSP has a polynomial algorithm, this book settles the P vs NP question.This book has illustrative examples, figures, and easily accessible proofs for showing this unexpected result. This book introduces novel constructions and ideas previously not used in the literature. Another interesting feature of this book is it uses basic max-flow and linear multicommodity flow algorithms and concepts in theseproofs establishing efficient membership checking for the pedigree polytope. Chapters 3-7 can be adopted to give a course on Efficient Combinatorial Optimization. This book is the culmination of the author's research that started in 1982 through a presentation on a new formulation of STSP at the XIth International Symposium on Mathematical Programming at Bonn.

This book presents an enticing introduction to tropical circuits and their use as a rigorous mathematical model for dynamic programming (DP), which is one of the most fundamental algorithmic paradigms for solving combinatorial, discrete optimization problems. In DP, an optimization problem is broken up into smaller subproblems that are solved recursively. Many classical DP algorithms are pure in that they only use the basic (min,+) or (max,+) operations in their recursion equations. In tropical circuits, these operations are used as gates. Thanks to the rigorous combinatorial nature of tropical circuits, elements from the Boolean and arithmetic circuit complexity can be used to obtain lower bounds for tropical circuits, which play a crucial role in understanding the limitations and capabilities of these computational models. This book aims to offer a toolbox for proving lower bounds on the size of tropical circuits.In this work, the reader will find lower-bound ideas and methods that have emerged in the last few years, with detailed proofs. Largely self-contained, this book is meant to be approachable by graduate students in mathematics and computer science with a special interest in circuit complexity.

The authors stress the relative simplicity, efficiency, flexibility of use, and suitability of various approaches used to solve difficult optimization problems. The authors are experienced, interdisciplinary lecturers and researchers and in their explanations they demonstrate many shared foundational concepts among the key methodologies. This textbook is a suitable introduction for undergraduate and graduate students, researchers, and professionals in computer science, engineering, and logistics.

The special volume offers a global guide to new concepts and approaches concerning the following topics: reduced basis methods, proper orthogonal decomposition, proper generalized decomposition, approximation theory related to model reduction, learning theory and compressed sensing, stochastic and high-dimensional problems, system-theoretic methods, nonlinear model reduction, reduction of coupled problems/multiphysics, optimization and optimal control, state estimation and control, reduced order models and domain decomposition methods, Krylov-subspace and interpolatory methods, and applications to real industrial and complex problems.The book represents the state of the art in the development of reduced order methods. It contains contributions from internationally respected experts, guaranteeing a wide range of expertise and topics. Further, it reflects an important effort, carried out over the last 12 years, to build a growing research community in this field.Though not a textbook, some of the chapters can be used as reference materials or lecture notes for classes and tutorials (doctoral schools, master classes).

This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering.'Mathematicians wishing a self-contained introduction need look no further.'— American Mathematical Monthly.

This work presents lines of investigation and scientific achievements of the Ukrainian school of optimization theory and adjacent disciplines. These include the development of approaches to mathematical theories, methodologies, methods, and application systems for the solution of applied problems in economy, finances, energy saving, agriculture, biology, genetics, environmental protection, hardware and software engineering, information protection, decision making, pattern recognition, self-adapting control of complicated objects, personnel training, etc. The methods developed include sequential analysis of variants, nondifferential optimization, stochastic optimization, discrete optimization, mathematical modeling, econometric modeling, solution of extremum problems on graphs, construction of discrete images and combinatorial recognition, etc. Some of these methods became well known in the world's mathematical community and are now known as classic methods.

Computational complexity, originated from the interactions between computer science and numerical 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.This book is a collection of articles on recent complexity developments in numerical optimization. The topics covered include complexity of approximation algorithms, new polynomial time algorithms for convex quadratic minimization, interior point algorithms, complexity issues regarding test generation of NP-hard problems, complexity of scheduling problems, min-max, fractional combinatorial optimization, fixed point computations and network flow problems.The collection of articles provide a broad spectrum of the direction in which research is going and help to elucidate the nature of computational complexity in optimization. The book will be a valuable source of information to faculty, students and researchers in numerical optimization and related areas.