Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models
暂无分享,去创建一个
[1] J. M. Martínez,et al. On sequential optimality conditions for smooth constrained optimization , 2011 .
[2] 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..
[3] Nicholas I. M. Gould,et al. Improved second-order evaluation complexity for unconstrained nonlinear optimization using high-order regularized models , 2017, ArXiv.
[4] P. Toint,et al. Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization , 2015 .
[5] Nicholas I. M. Gould,et al. On the complexity of finding first-order critical points in constrained nonlinear optimization , 2014, Math. Program..
[6] Zengxin Wei,et al. On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods , 1999, SIAM J. Optim..
[7] P. Toint,et al. An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity , 2012 .
[8] Nicholas I. M. Gould,et al. On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems , 2010, SIAM J. Optim..
[9] José Mario Martínez,et al. A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences , 2010, SIAM J. Optim..
[10] Nicholas I. M. Gould,et al. Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares , 2010, SIAM J. Numer. Anal..
[11] José Mario Martínez,et al. Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models , 2017, Math. Program..
[12] José Mario Martínez,et al. Practical augmented Lagrangian methods for constrained optimization , 2014, Fundamentals of algorithms.
[13] P. Toint,et al. Adaptive cubic overestimation methods for unconstrained optimization , 2007 .
[14] J. Bolte,et al. Characterizations of Lojasiewicz inequalities: Subgradient flows, talweg, convexity , 2009 .
[15] R. Andreani,et al. On sequential optimality conditions for smooth constrained optimization , 2011 .
[16] Nicholas I. M. Gould,et al. On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming , 2011, SIAM J. Optim..
[17] R. Tyrrell Rockafellar,et al. Lagrange Multipliers and Optimality , 1993, SIAM Rev..
[18] J. Dussault. Simple unified convergence proofs for Trust Region and a new ARC variant , 2015 .
[19] Nicholas I. M. Gould,et al. Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization , 2017, Math. Program..
[20] Ya-xiang Yuan,et al. On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization , 2015, Math. Program..
[21] Nicholas I. M. Gould,et al. On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization , 2012, SIAM J. Optim..
[22] Yurii Nesterov,et al. Cubic regularization of Newton method and its global performance , 2006, Math. Program..
[23] S. Łojasiewicz. Ensembles semi-analytiques , 1965 .
[24] Luís Nunes Vicente,et al. Worst case complexity of direct search , 2013, EURO J. Comput. Optim..