On the complexity of finding first-order critical points in constrained nonlinear optimization (2012)
Attributed to:
Algorithms and Software for Large-Scale Sparse or Structured Systems
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/s10107-012-0617-9
Publication URI: http://dx.doi.org/10.1007/s10107-012-0617-9
Type: Journal Article/Review
Parent Publication: Mathematical Programming
Issue: 1-2