Login / Signup

Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints.

Coralia CartisNicholas I. M. GouldPhilippe L. Toint
Published in: SIAM J. Optim. (2020)
Keyphrases
  • complexity bounds
  • worst case
  • optimization problems
  • constraint satisfaction
  • constraint networks
  • response time
  • logic programs
  • spatial information
  • constrained optimization
  • nonlinear programming