On the complexity of finding first-order critical points in constrained nonlinear optimization

DOI10.1007/s10107-012-0617-9zbMath1301.68154WikidataQ58185701 ScholiaQ58185701MaRDI QIDQ2452373

Coralia Cartis, Nicholas I. M. Gould, Phillipe L. Toint

Publication date: 2 June 2014

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: http://purl.org/net/epubs/manifestation/6466/RAL-TR-2011-008.pdf

zbMATH Keywords

worst-case analysis; constrained nonlinear optimization; evaluation complexity

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

90C60: Abstract computational complexity for mathematical programming problems

90C30: Nonlinear programming