Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization

Type: Preprint

Publication Date: 2017-01-01

Citations: 2

DOI: https://doi.org/10.48550/arxiv.1705.07285

Locations

  • arXiv (Cornell University) - View - PDF
  • Science and Technology Facilities Council - View - PDF
  • DataCite API - View

Similar Works

Action Title Year Authors
+ Optimality of orders one to three and beyond: Characterization and evaluation complexity in constrained nonconvex optimization 2018 Coralia Cartis
Nicholas I. M. Gould
Philippe L. Toint
+ Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models 2016 E. G. Birgin
John Lenon Cardoso Gardenghi
J. M. Martı́nez
Sandra A. Santos
Philippe L. Toint
+ PDF Chat On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods 2015 Coralia Cartis
Nicholas I. M. Gould
Philippe L. Toint
+ Evaluation complexity bounds for smooth constrained nonlinear optimisation using scaled KKT conditions, high-order models and the criticality measure $χ$ 2017 Coralia Cartis
Nicholas I. M. Gould
Philippe L. Toint
+ PDF Chat A concise second-order complexity analysis for unconstrained optimization using high-order regularized models 2019 Coralia Cartis
Nicholas I. M. Gould
Philippe L. Toint
+ Evaluation complexity bounds for smooth constrained nonlinear optimisation using scaled KKT conditions, high-order models and the criticality measure $χ$. 2017 Coralia Cartis
Nicholas I. M. Gould
Philippe L. Toint
+ Improved second-order evaluation complexity for unconstrained nonlinear optimization using high-order regularized models 2017 Coralia Cartis
Nicholas I. M. Gould
Philippe L. Toint
+ The evaluation complexity of finding high-order minimizers of nonconvex optimization 2023 Coralia Cartis
Nicholas I. M. Gould
Philippe L. Toint
+ Second-order optimality and beyond: characterization and evaluation complexity in nonconvex convexly-constrained optimization 2016 Coralia Cartis
Nim Gould
PL Toint
+ Improved second-order evaluation complexity for unconstrained nonlinear optimization using high-order regularized models 2017 Coralia Cartis
Nicholas I. M. Gould
Philippe L. Toint
+ Second Order and High Order Approaches for Nonconvex Optimization with Objective Function-Free Algorithms 2024 Sadok Jerad
+ PDF Chat Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization 2016 Coralia Cartis
Nicholas I. M. Gould
Philippe L. Toint
+ PDF Chat On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization 2013 Coralia Cartis
Nicholas I. M. Gould
Philippe L. Toint
+ Second-order methods for nonconvex optimization : theory and complexity analysis 2016 Hong Wang
+ Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization 2017 Coralia Cartis
Nicholas I. M. Gould
Philippe L. Toint
+ Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization 2017 Coralia Cartis
Nicholas I. M. Gould
Philippe L. Toint
+ PDF Chat WORST-CASE EVALUATION COMPLEXITY AND OPTIMALITY OF SECOND-ORDER METHODS FOR NONCONVEX SMOOTH OPTIMIZATION 2019 Coralia Cartis
Nicholas I. M. Gould
Philippe L. Toint
+ Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization 2017 Clément W. Royer
Stephen J. Wright
+ Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization 2017 Clément W. Royer
Stephen J. Wright
+ PDF Chat Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization 2018 Clément W. Royer
Stephen J. Wright

Works Cited by This (0)

Action Title Year Authors