1976
DOI: 10.1109/tmtt.1976.1128785
|View full text |Cite
|
Sign up to set email alerts
|

New Results in the Least pth Approach to Minimax Design

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
4
0

Year Published

1977
1977
1981
1981

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 10 publications
(4 citation statements)
references
References 5 publications
0
4
0
Order By: Relevance
“…Charalambous [66] and Bandler et al [25,26] took ~r+~ to be the lower bound on the maximum predicted under convexity assumptions after each optimization. The constant ~r is used as a lower bound for the (r+ 1)th optimization so that all the functions less than this constant are discarded and considered inactive.…”
Section: Algorithm 21mentioning
confidence: 99%
See 3 more Smart Citations
“…Charalambous [66] and Bandler et al [25,26] took ~r+~ to be the lower bound on the maximum predicted under convexity assumptions after each optimization. The constant ~r is used as a lower bound for the (r+ 1)th optimization so that all the functions less than this constant are discarded and considered inactive.…”
Section: Algorithm 21mentioning
confidence: 99%
“…Recently, Bandler et al [26,40,78] used extrapolation to p = 0% after performing least pth approximation with different values of p, with ui = 1, i = 1,2 ..... n, to obtain the :minimax solution. The algorithm, called the p algorithm, has been implemented in a user-oriented package called FLOPT4 [40], which is currently used for solving many engineering design problems.…”
Section: Algorithm 21mentioning
confidence: 99%
See 2 more Smart Citations