ISSN:
1436-4646
Keywords:
Random methods
;
necessary constraints
;
redundancy
;
coordinate directions
;
hypersphere directions
;
linear inequalities
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract A new approach is given for the analysis of random methods for detecting necessary constraints in systems of linear inequality constraints. This new approach directly accounts for the fact that two constraints are detected as necessary (hit) at each iteration of a random method. The significance of this two-hit analysis is demonstrated by comparing it with the usual one-hit analysis.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01582281
Permalink