The open archive for STFC research publications
Suggest an Enhancement
Full Record Details
Second-order optimality and beyond: characterization and evaluation complexity in nonconvex convexly-constrained optimization
C Cartis (Oxford U.)
NIM Gould (STFC Rutherford Appleton Laboratory Lab.)
PL Toint (University of Namur)
High-order optimality conditions for convexly-constrained nonlinear optimization problems are analyzed. A corresponding (expensive) measure of criticality for arbitrary order is proposed and extended to define high-order ?-approximate critical points. This new measure is then used within a conceptual trust-region algorithm to show that, if derivatives of the objective function up to order q ? 1 can be evaluated and are Lipschitz continuous, then this algorithm applied to the convexly constrained problem needs at most O(??(q+1)) evaluations of f and its derivatives to compute an ?-approximate q-th order critical point. This provides the first evaluation complexity result for critical points of arbitrary order in nonlinear optimization. An example is discussed showing that the obtained evaluation complexity bounds are essentially sharp.
Related Research Object(s):
RAL-P-2016-008, Foundations of Computational Mathematics 2016 2016.
Showing record 1 of 1
Login to Add and Manage Publications
Chadwick & RAL Libraries
Terms & conditions
Science and Technology Facilities Council
Switchboard: 01793 442000