Active-set Newton-MR methods for bound-constrained nonconvex minimization with O(n ε^-2) and O(n |log2 ε| ε^-3/2) worst-case oracle complexity, backed by CUTEst evidence that MINRES beats CG in the same active-set framework.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Active-set Newton-MR methods for nonconvex optimization problems with bound constraints
Active-set Newton-MR methods for bound-constrained nonconvex minimization with O(n ε^-2) and O(n |log2 ε| ε^-3/2) worst-case oracle complexity, backed by CUTEst evidence that MINRES beats CG in the same active-set framework.