Dansk
DTU.dk
Index
Contact
Phone book
Internal Pages
DTU Alumni
Søgeord
Education
Education
MSc degree programme
PhD programmes
IMM courses
Coursebase DTU
Laboratories
Summer Schools
Welcome to DTU
DTU Informatics bookshop
Research
Research
Research areas
Algorithms and Logic
Cognitive Systems
Data Analysis
Dynamical Systems
---
Image Analysis & Computer Graphics
Language-Based Technology
Mathematical Statistics
Scientific Computing
Software Engineering
Research centers
Publications
Industrial collaboration
Industrial collaboration
Public sector consultancy
Advanced Technology Foundation Projects
Continuing education
Model-based Software Engineering Center
MT-Lab
PhD education
Software Development Center
Statistical Consulting Center
About DTU Informatics
About DTU Informatics
Contact
Employees
Facts about DTU Informatics
Getting to DTU Informatics
Advisory Board
Information material
Find the expert
Organisation
Vision
Available jobs
Library
Portalen DTU
Alumni association (in Danish)
News
News
Latest news
News Archive at DTU Informatics
Calendar at DTU Informatics
English
>
About DTU Informatics
>
Employees
Print
Contact
Employees
Facts about DTU Informatics
Getting to DTU Informatics
Advisory Board
Information material
Find the expert
Organisation
Vision
Available jobs
Library
Portalen DTU
Alumni association (in Danish)
Title:
Towards a Rigorous Formulation of the Space Mapping Technique for Engineering Design
Type:
Article in proceedingsArticle in proceedings
Participant(s):
Forfatter: Koziel, Slawek
Technical University of Denmark
Forfatter: Bandler, John W.
Technical University of Denmark
Author:
Madsen, Kaj
(Cwisno: 1565)
Technical University of Denmark
Email:
---
Abstract:
This paper deals with the Space Mapping (SM) approach to engineering design optimization. We attempt here a theoretical justification of methods that have already proven efficient in solving practical problems, especially in the RF and microwave area. A formal definition of optimization algorithms using surrogate models based on SM technology is given. Convergence conditions for the chosen subclass of algorithms are discussed and explained using a synthetic example, the so-called generalized cheese-cutting problem. An illustrative, circuit-theory based example is also considered.
Published:
part of: Int. Symp. Circuits, Syst. ISCAS (Kobe, Japan), pages: 5605-5608, 2005,
See the publication in DTU Orbit
Top
Matematiktorvet
DTU - Building 303B
DK-2800 Kgs. Lyngby
---
Tel +45 4525 3031
EAN 5798000428515
Cookies