Complexity bounds for second-order optimality in unconstrained optimization.

Complexity bounds for second-order optimality in unconstrained optimization.

Bibliografske podrobnosti
Main Authors:	Cartis, C, Gould, N, Toint, P
Format:	Journal article
Izdano:	2012

Podobne knjige/članki

A concise second-order complexity analysis for unconstrained optimization using high-order regularized models
od: Cartis, C, et al.
Izdano: (2019)

Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization.
od: Cartis, C, et al.
Izdano: (2012)

Second-order optimality and beyond: characterization and evaluation complexity in convexly-constrained nonlinear optimization
od: Cartis, C, et al.
Izdano: (2017)

Adaptive cubic overestimation methods for unconstrained optimization
od: Cartis, C, et al.
Izdano: (2007)

Adaptive cubic overestimation methods for unconstrained optimization
od: Cartis, C, et al.
Izdano: (2007)

On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems.
od: Cartis, C, et al.
Izdano: (2010)

Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization
od: Cartis, C, et al.
Izdano: (2018)

Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients
od: Cartis, C, et al.
Izdano: (2017)

Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints
od: Cartis, C, et al.
Izdano: (2020)

Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity.
od: Cartis, C, et al.
Izdano: (2011)

Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models
od: Cartis, C, et al.
Izdano: (2019)

On the evaluation complexity of constrained nonlinear least-squares and general constrained nonlinear optimization using second-order methods
od: Cartis, C, et al.
Izdano: (2015)

Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results.
od: Cartis, C, et al.
Izdano: (2011)

On the complexity of finding first-order critical points in constrained nonlinear optimization
od: Cartis, C, et al.
Izdano: (2012)

Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization
od: Cartis, C, et al.
Izdano: (2016)

An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
od: Cartis, C, et al.
Izdano: (2012)

On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization.
od: Cartis, C, et al.
Izdano: (2012)

On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization
od: Cartis, C, et al.
Izdano: (2013)

Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
od: Cartis, C, et al.
Izdano: (2017)

Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
od: Cartis, C, et al.
Izdano: (2015)

On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming.
od: Cartis, C, et al.
Izdano: (2011)

A dimensionality reduction technique for unconstrained global optimization of functions with low effective dimensionality
od: Cartis, C, et al.
Izdano: (2021)

A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function.
od: Cartis, C, et al.
Izdano: (2013)

Objective acceleration for unconstrained optimization
od: Riseth, A
Izdano: (2018)

Towards large scale unconstrained optimization
od: Abu Hassan, Malik
Izdano: (2007)

An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems
od: Bertsimas, Dimitris J., et al.
Izdano: (2014)

Trust-region and other regularisations of linear least-squares problems
od: Cartis, C, et al.
Izdano: (2008)

Trust-region and other regularisations of linear least-squares problems
od: Cartis, C, et al.
Izdano: (2009)

Universal regularization methods: varying the power, the smoothness and the accuracy
od: Cartis, C, et al.
Izdano: (2019)

Globalization of Barzilai and Borwein Method for Unconstrained Optimization
od: Farid, Mahboubeh
Izdano: (2009)

The CG-BFGS method for unconstrained optimization problems
od: Ibrahim, Mohd Asrul Hery, et al.
Izdano: (2013)

Efficient ODE-based methods for unconstrained optimization
od: Yap, Chui Ying, et al.
Izdano: (2018)

The algorithms of Broyden-CG for unconstrained optimization problems
od: Ibrahim, Mohd Asrul Hery, et al.
Izdano: (2014)

Hybridizing Invasive Weed Optimization with Firefly Algorithm for Unconstrained and Constrained Optimization Problems
od: Hyreil A., Kasdirin, et al.
Izdano: (2017)

Scaling symmetric rank one update for unconstrained optimization
od: Abu Hassan, Malik, et al.
Izdano: (2003)

Scaling symmetric rank one update for unconstrained optimization
od: Abu Hassan, Malik, et al.
Izdano: (2002)

Structured symmetric rank-one method for unconstrained optimization
od: Modarres, Farzin, et al.
Izdano: (2011)

Implementation of Symmetric Rank-One Methods for Unconstrained Optimization
od: Khiyaban, Farzin Modarres
Izdano: (2010)

Convergence and stability of line search methods for unconstrained optimization.
od: Leong, Wah June, et al.
Izdano: (2013)

Multiple Alternate Steps Gradient Methods For Unconstrained Optimization
od: Lee, Sui Fong
Izdano: (2009)