The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2002
DOI: 10.1007/978-94-015-9896-5
|View full text |Cite
|
Sign up to set email alerts
|

Algorithmic Principles of Mathematical Programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
51
0
1

Year Published

2006
2006
2020
2020

Publication Types

Select...
5
4

Relationship

3
6

Authors

Journals

citations
Cited by 50 publications
(56 citation statements)
references
References 0 publications
0
51
0
1
Order By: Relevance
“…The method applied to obtain the results presented in this paper is the Gauss-Newton technique. 25 Generally, choosing the model with the fewest parameters that can fully explain the behavior yields the most consistent results. If the response seems to rise in a first-order fashion to the steady state, then approximate model 2 is more appropriate.…”
Section: B Extraction Of Coating Propertiesmentioning
confidence: 99%
“…The method applied to obtain the results presented in this paper is the Gauss-Newton technique. 25 Generally, choosing the model with the fewest parameters that can fully explain the behavior yields the most consistent results. If the response seems to rise in a first-order fashion to the steady state, then approximate model 2 is more appropriate.…”
Section: B Extraction Of Coating Propertiesmentioning
confidence: 99%
“…(P) are given by the following: If x P is a local minimizer of problem (P), then there exist (see for example [2,5]) vectors 0 = λ ∈ R q+1 + and ν ∈ R m + satisfying q i=0 λ i ∇f i (x P ) + m k=1 ν k a k = 0, λ i f i (x P ) = 0, 1 ≤ i ≤ q and ν k (a k x P − b k ) = 0, 1 ≤ k ≤ m.…”
Section: The Fj and Kkt Conditions For Problems (P) And (Q)mentioning
confidence: 99%
“…For optimization problem (Q) the resulting FJ conditions are as follows: If x Q is a local minimizer of problem (Q), then there exist (see for example [2,5]…”
Section: The Fj and Kkt Conditions For Problems (P) And (Q)mentioning
confidence: 99%
“…However, if the augmenting path is always selected according to the Edmonds-Karp rule ( [10]), i.e., as a path P ∈ P x with a minimal number of arcs, termination after at most |V | · |E| augmentations is guaranteed (see, e.g., [1] or [12]). So we find that the running time of the Ford-Fulkerson algorithm depends strongly on our preferences for breaking possible ties among augmenting paths.…”
Section: Introductionmentioning
confidence: 99%