2004
DOI: 10.1023/b:aurc.0000019371.51497.90
|View full text |Cite
|
Sign up to set email alerts
|

Stability Analysis of Some Discrete Optimization Algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2009
2009
2012
2012

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 3 publications
0
1
0
Order By: Relevance
“…Numerous publications (see, e.g., [1]) are devoted research of various as pests of stability of scalar and vector problems of discrete optimization. Questions of stability not only decisions of problems of discrete optimization, but also algorithms of their decision (see, e.g., [2,3]) are actual. One of possible variants of research of stability local (gradient) algorithms is the finding of chance of the guaranteed (relative) estimations at "small" indignations of parameters of a problem.…”
Section: Introductionmentioning
confidence: 99%
“…Numerous publications (see, e.g., [1]) are devoted research of various as pests of stability of scalar and vector problems of discrete optimization. Questions of stability not only decisions of problems of discrete optimization, but also algorithms of their decision (see, e.g., [2,3]) are actual. One of possible variants of research of stability local (gradient) algorithms is the finding of chance of the guaranteed (relative) estimations at "small" indignations of parameters of a problem.…”
Section: Introductionmentioning
confidence: 99%