On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming (2011)
Attributed to:
Linear Algebra and Optimization: Structure, Sparsity, Algorithms and Software
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1137/11082381x
Publication URI: http://dx.doi.org/10.1137/11082381x
Type: Journal Article/Review
Parent Publication: SIAM Journal on Optimization
Issue: 4