Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints. Cartis, C., Gould, N. I. M., & Toint, P. L. arXiv:1811.01220, November, 2018. arXiv: http://arxiv.org/abs/1811.01220
bibtex   
@article{cartis_sharp_2018,
	title = {Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints},
	journal = {arXiv:1811.01220},
	author = {Cartis, Coralia and Gould, Nick I. M. and Toint, Philippe L.},
	month = nov,
	year = {2018},
	note = {arXiv: http://arxiv.org/abs/1811.01220},
	keywords = {/unread, 49K10, 49M37, 65K05, 65Y20, 68T05, 68W40, F.1.3, F.2.1, G.1.6, I.2.6, cs.AI, cs.CC, math.NA, math.OC, ⛔ No DOI found},
}

Downloads: 0