2008
DOI: 10.1080/10556780701521670
|View full text |Cite
|
Sign up to set email alerts
|

Pattern search in the presence of degenerate linear constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
15
0
4

Year Published

2008
2008
2021
2021

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 16 publications
(19 citation statements)
references
References 15 publications
0
15
0
4
Order By: Relevance
“…The principal solution method is to eliminate the energy dependence on μ by defining an effective attenuation, (6) μ eff (x) ≡ ∞…”
Section: R • (S(e) Exp [−P (μ(R E))]) Dementioning
confidence: 99%
See 2 more Smart Citations
“…The principal solution method is to eliminate the energy dependence on μ by defining an effective attenuation, (6) μ eff (x) ≡ ∞…”
Section: R • (S(e) Exp [−P (μ(R E))]) Dementioning
confidence: 99%
“…To guarantee that theoretical convergence properties still hold, the only additional requirement is that the rule for selecting polling directions must conform to the geometry of the nearby linear constraint boundaries [4,10]. An algorithm for constructing conforming directions is given in [23] and [6] in the nondegenerate and degenerate cases, respectively. 1, 2, . .…”
Section: Mixed Variable Formulationmentioning
confidence: 99%
See 1 more Smart Citation
“…If there are only bounds on the variables, such a scheme is ensured simply by considering all the coordinate directions [98]. For general non-degenerate linear constraints, there are schemes to compute such positive generators [100] (for the degenerate case see [17]). If the objective function is continuously differentiable, the resulting direct-search methods are globally convergent to first-order stationary points [100] (see also [93]), in other words, to points where the gradient is in the polar of the tangent cone, implying that the directional derivative is nonnegative for all directions in the tangent cone.…”
Section: Sampling Along Directionsmentioning
confidence: 99%
“…We choose ǫ k to be O(σ k ) as in [34] (to avoid considering all positive generators for all tangent cones for all ǫ ∈ [0, ǫ * ] where ǫ * > 0 is independently of the iteration counter as proposed in [38]). We then use the following algorithm from [52] to compute the set D k of positive generators for corresponding tangent cone (in turn inspired by the work in [38,3]). Basically, the idea of this algorithm is to dynamically decrease ǫ k in the search for a set of positive generators of a tangent cone corresponding to a full row rank matrix C k .…”
Section: For the Approach Based On Extreme Barrier And The Inclusion mentioning
confidence: 99%