Develops polling sets for direct search under polyhedral convex constraints that satisfy new requirements for complexity analysis, including directions outside the tangent cone.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Polling Set Construction and Worst-Case Complexity for Direct Search under Polyhedral Convex Constraints
Develops polling sets for direct search under polyhedral convex constraints that satisfy new requirements for complexity analysis, including directions outside the tangent cone.