Premium
One‐dimensional orthogonal search—a method for a segment approximation to acceptability regions
Author(s) -
Ogrodzki Jan
Publication year - 1986
Publication title -
international journal of circuit theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.364
H-Index - 52
eISSN - 1097-007X
pISSN - 0098-9886
DOI - 10.1002/cta.4490140302
Subject(s) - bilinear interpolation , space (punctuation) , mathematical optimization , computer science , order (exchange) , mathematics , parameter space , bilinear form , algorithm , theoretical computer science , pure mathematics , geometry , finance , economics , computer vision , operating system
As is well known, computer‐aided design methods that make use of specific properties of the networks being solved are much more efficient than general approaches suitable for very large classes of problems. In this paper an approach to acceptability regions, grounded on the bilinear theorem convenient for linear networks, is studied. Thanks to the bilinearity, exact analytical solutions on first‐order linear manifolds in the parameter space, i.e. when only one parameter is being changed at time, are available. This so‐called one‐dimensional orthogonal search (ODOS) has been applied to a segment approximation of acceptability regions. This approach lead; to spectacular results concerning shapes of acceptability regions, applicable in fundamental design problems.