scispace - formally typeset
Search or ask a question
Author

John W. Bandler

Bio: John W. Bandler is an academic researcher from McMaster University. The author has contributed to research in topics: Space mapping & Surrogate model. The author has an hindex of 55, co-authored 389 publications receiving 11330 citations. Previous affiliations of John W. Bandler include Reykjavík University & Imperial College London.


Papers
More filters
Journal ArticleDOI
TL;DR: For the first time, a mathematical motivation is presented and SM is placed into the context of classical optimization to achieve a satisfactory solution with a minimal number of computationally expensive "fine" model evaluations.
Abstract: We review the space-mapping (SM) technique and the SM-based surrogate (modeling) concept and their applications in engineering design optimization. For the first time, we present a mathematical motivation and place SM into the context of classical optimization. The aim of SM is to achieve a satisfactory solution with a minimal number of computationally expensive "fine" model evaluations. SM procedures iteratively update and optimize surrogates based on a fast physically based "coarse" model. Proposed approaches to SM-based optimization include the original algorithm, the Broyden-based aggressive SM algorithm, various trust-region approaches, neural SM, and implicit SM. Parameter extraction is an essential SM subproblem. It is used to align the surrogate (enhanced coarse model) with the fine model. Different approaches to enhance uniqueness are suggested, including the recent gradient parameter-extraction approach. Novel physical illustrations are presented, including the cheese-cutting and wedge-cutting problems. Significant practical applications are reviewed.

1,044 citations

Journal ArticleDOI
John W. Bandler1, R.M. Biernacki1, S.H. Chen1, P.A. Grobelny1, R.H. Hemmers1 
TL;DR: In this article, the authors propose space mapping (SM) for circuit optimization utilizing a parameter space transformation, which is demonstrated by the optimization of a microstrip structure for which a convenient analytical/empirical model is assumed to be unavailable.
Abstract: We offer space mapping (SM), a fundamental new theory to circuit optimization utilizing a parameter space transformation. This technique is demonstrated by the optimization of a microstrip structure for which a convenient analytical/empirical model is assumed to be unavailable. For illustration, we focus upon a three-section microstrip impedance transformer and a double folded stub microstrip filter and explore various design characteristics utilizing an electromagnetic (EM) field simulator. We propose two distinct EM models: coarse for fast computations, and the corresponding fine for a few more accurate and well-targeted simulations. The coarse model, useful when circuit-theoretic models are not readily available, permits rapid exploration of different starting points, solution robustness, local minima, parameter sensitivities, yield-driven design and other design characteristics within a practical time frame. The computationally intensive fine model is used to verify the space-mapped designs obtained exploiting the coarse model, as well as in the SM process itself. >

584 citations

Journal ArticleDOI
01 Aug 1985
TL;DR: In this paper, various fault location techniques in analog networks are described and compared and the emphasis is on the more recent developments in the subject.
Abstract: In this paper, various fault location techniques in analog networks are described and compared. The emphasis is on the more recent developments in the subject. Four main approaches for fault location are addressed, examined, and illustrated using simple network examples. In particular, we consider the fault dictionary approach, the parameter identification approach, the fault verification approach, and the approximation approach. Theory and algorithms that are associated with these approaches are reviewed and problems of their practical application are identified. Associated with the fault dictionary approach we consider fault dictionary construction techniques, methods of optimum measurement selection, different fault isolation criteria, and efficient fault simulation techniques. Parameter identification techniques that either utilize linear or nonlinear systems of equations to identify all network elements are examined very thoroughly. Under fault verification techniques we discuss node-fault diagnosis, branch-fault diagnosis, subnetwork testability conditions as well as combinatorial techniques, the failure bound technique, and the network decomposition technique. For the approximation approach we consider probabilistic methods and optimization-based methods. The artificial intelligence technique and the different measures of testability are also considered. The main features of the techniques considered are summarized in a comparative table. An extensive, but not exhaustive, bibliography is provided.

447 citations

Journal ArticleDOI
TL;DR: In this paper, the authors proposed a significantly improved space mapping (SM) strategy for electromagnetic (EM) optimization, which leverages every available EM analysis, producing dramatic results right from the first step, instead of waiting for upfront EM analyses at several base points.
Abstract: We propose a significantly improved space mapping (SM) strategy for electromagnetic (EM) optimization. Instead of waiting for upfront EM analyses at several base points, our new approach aggressively exploits every available EM analysis, producing dramatic results right from the first step. We establish a relationship between the novel SM optimization and the quasi-Newton iteration for solving a system of nonlinear equations. Approximations to the matrix of first-order derivatives are updated by the classic Broyden formula. A high-temperature superconducting microstrip filter design solution emerges after only six EM simulations with sparse frequency sweeps. Furthermore, less CPU effort is required to optimize the filter than is required by one single detailed frequency sweep. We also extend the SM concept to the parameter extraction phase, overcoming severely misaligned responses induced by inadequate empirical models. This novel concept should have a significant impact on parameter extraction of devices.

387 citations

Journal Article
TL;DR: A generic space-mapping optimization algorithm is formulated, explained step-by-step using a simple microstrip filter example, and its robustness is demonstrated through the fast design of an interdigital filter.
Abstract: In this article we review state-of-the-art concepts of space mapping and place them con- textually into the history of design optimization and modeling of microwave circuits. We formulate a generic space-mapping optimization algorithm, explain it step-by-step using a simple microstrip filter example, and then demonstrate its robustness through the fast design of an interdigital filter. Selected topics of space mapping are discussed, including implicit space mapping, gradient-based space mapping, the optimal choice of surrogate model, and tuning space mapping. We consider the application of space mapping to the modeling of microwave structures. We also discuss a software package for automated space-mapping optimization that involves both electromagnetic (EM) and circuit simulators.

327 citations


Cited by
More filters
Journal Article
TL;DR: This book by a teacher of statistics (as well as a consultant for "experimenters") is a comprehensive study of the philosophical background for the statistical design of experiment.
Abstract: THE DESIGN AND ANALYSIS OF EXPERIMENTS. By Oscar Kempthorne. New York, John Wiley and Sons, Inc., 1952. 631 pp. $8.50. This book by a teacher of statistics (as well as a consultant for \"experimenters\") is a comprehensive study of the philosophical background for the statistical design of experiment. It is necessary to have some facility with algebraic notation and manipulation to be able to use the volume intelligently. The problems are presented from the theoretical point of view, without such practical examples as would be helpful for those not acquainted with mathematics. The mathematical justification for the techniques is given. As a somewhat advanced treatment of the design and analysis of experiments, this volume will be interesting and helpful for many who approach statistics theoretically as well as practically. With emphasis on the \"why,\" and with description given broadly, the author relates the subject matter to the general theory of statistics and to the general problem of experimental inference. MARGARET J. ROBERTSON

13,333 citations

Journal ArticleDOI
TL;DR: The present state of the art of constructing surrogate models and their use in optimization strategies is reviewed and extensive use of pictorial examples are made to give guidance as to each method's strengths and weaknesses.

1,919 citations

Journal ArticleDOI
TL;DR: This review begins by briefly summarizing the history of direct search methods and considering the special properties of problems for which they are well suited, then turns to a broad class of methods for which the underlying principles allow general-ization to handle bound constraints and linear constraints.
Abstract: Direct search methods are best known as unconstrained optimization techniques that do not explicitly use derivatives. Direct search methods were formally proposed and widely applied in the 1960s but fell out of favor with the mathematical optimization community by the early 1970s because they lacked coherent mathematical analysis. Nonetheless, users remained loyal to these methods, most of which were easy to program, some of which were reliable. In the past fifteen years, these methods have seen a revival due, in part, to the appearance of mathematical analysis, as well as to interest in parallel and distributed com- puting. This review begins by briefly summarizing the history of direct search methods and considering the special properties of problems for which they are well suited. Our focus then turns to a broad class of methods for which we provide a unifying framework that lends itself to a variety of convergence results. The underlying principles allow general- ization to handle bound constraints and linear constraints. We also discuss extensions to problems with nonlinear constraints.

1,652 citations

Journal ArticleDOI
01 Jan 2006
TL;DR: This work reviews the state-of-the-art metamodel-based techniques from a practitioner's perspective according to the role of meetamodeling in supporting design optimization, including model approximation, design space exploration, problem formulation, and solving various types of optimization problems.
Abstract: Computation-intensive design problems are becoming increasingly common in manufacturing industries. The computation burden is often caused by expensive analysis and simulation processes in order to reach a comparable level of accuracy as physical testing data. To address such a challenge, approximation or metamodeling techniques are often used. Metamodeling techniques have been developed from many different disciplines including statistics, mathematics, computer science, and various engineering disciplines. These metamodels are initially developed as “surrogates” of the expensive simulation process in order to improve the overall computation efficiency. They are then found to be a valuable tool to support a wide scope of activities in modern engineering design, especially design optimization. This work reviews the state-of-the-art metamodel-based techniques from a practitioner’s perspective according to the role of metamodeling in supporting design optimization, including model approximation, design space exploration, problem formulation, and solving various types of optimization problems. Challenges and future development of metamodeling in support of engineering design is also analyzed and discussed.Copyright © 2006 by ASME

1,503 citations

Journal ArticleDOI
TL;DR: A Composite PSO, in which the heuristic parameters of PSO are controlled by a Differential Evolution algorithm during the optimization, is described, and results for many well-known and widely used test functions are given.
Abstract: This paper presents an overview of our most recent results concerning the Particle Swarm Optimization (PSO) method. Techniques for the alleviation of local minima, and for detecting multiple minimizers are described. Moreover, results on the ability of the PSO in tackling Multiobjective, Minimax, Integer Programming and e1 errors-in-variables problems, as well as problems in noisy and continuously changing environments, are reported. Finally, a Composite PSO, in which the heuristic parameters of PSO are controlled by a Differential Evolution algorithm during the optimization, is described, and results for many well-known and widely used test functions are given.

1,436 citations