Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models
From MaRDI portal
Publication:2337587
DOI10.1007/978-3-030-12767-1_2zbMath1425.90113OpenAlexW2251768944MaRDI QIDQ2337587
Coralia Cartis, Nicholas I. M. Gould, Phillipe L. Toint
Publication date: 20 November 2019
Full work available at URL: http://purl.org/net/epubs/manifestation/27207452/RAL-TR-2015-010.pdf
Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
An active set trust-region method for bound-constrained optimization, Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems, Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization, A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees, On Regularization and Active-set Methods with Complexity for Constrained Optimization, Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary, Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity
