On the complexity of finding first-order critical points in constrained nonlinear optimization
The complexity of finding {Mathematical expression}-approximate first-order critical points for the general smooth constrained optimization problem is shown to be no worse that {Mathematical expression} in terms of function and constraints evaluations. This result is obtained by analyzing the worst-...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Published: |
2012
|