2019
DOI: 10.1007/978-3-030-21803-4_8
|View full text |Cite
|
Sign up to set email alerts
|

Discrete Interval Adjoints in Unconstrained Global Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 12 publications
0
2
0
Order By: Relevance
“…The general idea of b&b algorithms [21] used for global optimization problems as given in ( 3) is to remove all parts of the domain that cannot contain a global minimum. The implementation used for this case study is a variation of the one presented in [17] implementing Theorem 1. The user needs to specify at least one separator.…”
Section: Case Studymentioning
confidence: 99%
See 1 more Smart Citation
“…The general idea of b&b algorithms [21] used for global optimization problems as given in ( 3) is to remove all parts of the domain that cannot contain a global minimum. The implementation used for this case study is a variation of the one presented in [17] implementing Theorem 1. The user needs to specify at least one separator.…”
Section: Case Studymentioning
confidence: 99%
“…In [16] we discussed significance analysis in the context of neural networks. Deterministic global optimization through a check for first-order optimality is described in [17]. In the following we show how to use interval adjoints for a monotonicity check of structural separators and for the verification of these separators.…”
Section: Introductionmentioning
confidence: 99%