2006
DOI: 10.2514/1.15186
|View full text |Cite
|
Sign up to set email alerts
|

Integral Evaluations Enabling Performance Tradeoffs for Two-Confidence-Region-Based Failure Detection

Abstract: Engineering Notes ENGINEERING NOTES are short manuscripts describing new developments or important results of a preliminary nature. These Notes should not exceed 2500 words (where a figure or table counts as 200 words). Following informal review by the Editors, they may be published within a few months of the date of receipt. Style requirements are the same as for regular contributions (see inside back cover).

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2010
2010
2010
2010

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…Based on prior experience with quadratic forms as cost functions arising in optimization problems whose solutions are useful in navigation applications ( [2][3][4][5] (endorsed in [6]), [7][8][9]) and practice in having also provided two timely, critical counterexamples [10] to the methodology used in establishing a recent gravity model, we recognized the underlying problem posed in [1] to be a familiar minimization of a convex paraboloidal function, y ¼ f(x), going from Euclidean n-space x to a scalar y (i.e., f : E n ? R, where the linear weighting coefficients of [1, Eq.…”
Section: The Underlying Optimization Problemmentioning
confidence: 99%
“…Based on prior experience with quadratic forms as cost functions arising in optimization problems whose solutions are useful in navigation applications ( [2][3][4][5] (endorsed in [6]), [7][8][9]) and practice in having also provided two timely, critical counterexamples [10] to the methodology used in establishing a recent gravity model, we recognized the underlying problem posed in [1] to be a familiar minimization of a convex paraboloidal function, y ¼ f(x), going from Euclidean n-space x to a scalar y (i.e., f : E n ? R, where the linear weighting coefficients of [1, Eq.…”
Section: The Underlying Optimization Problemmentioning
confidence: 99%