Evaluation Complexity Bounds for Smooth Constrained Nonlinear Optimization Using Scaled KKT Conditions and High-Order Models
暂无分享,去创建一个
[1] S. Łojasiewicz. Ensembles semi-analytiques , 1965 .
[2] Dimitri P. Bertsekas,et al. Nonlinear Programming , 1997 .
[3] Yurii Nesterov,et al. Introductory Lectures on Convex Optimization - A Basic Course , 2014, Applied Optimization.
[4] Serge Gratton,et al. Stopping rules and backward error analysis for bound-constrained optimization , 2011, Numerische Mathematik.
[5] P. Toint,et al. An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity , 2012 .
[6] Nicholas I. M. Gould,et al. On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization , 2013, SIAM J. Optim..
[7] Nicholas I. M. Gould,et al. On the complexity of finding first-order critical points in constrained nonlinear optimization , 2014, Math. Program..
[8] Nicholas I. M. Gould,et al. On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods , 2015, SIAM J. Numer. Anal..
[9] P. Toint,et al. Improved worst-case evaluation complexity for potentially rank-deficient nonlinear least-Euclidean-norm problems using higher-order regularized models , 2015 .
[10] José Mario Martínez,et al. Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models , 2016, SIAM J. Optim..
[11] José Mario Martínez,et al. Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models , 2017, Math. Program..