Pages that link to "Item:Q652287"

The following pages link to Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity (Q652287):

Displaying 38 items.

• A concise second-order complexity analysis for unconstrained optimization using high-order regularized models (Q5210739) (← links)
• (Q5214226) (← links)
• Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints (Q5217594) (← links)
• Structured Quasi-Newton Methods for Optimization with Orthogonality Constraints (Q5230652) (← links)
• Gradient Descent Finds the Cubic-Regularized Nonconvex Newton Step (Q5233102) (← links)
• Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact (Q5235099) (← links)
• Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization (Q5244400) (← links)
• Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization (Q5248241) (← links)
• On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods (Q5253577) (← links)
• The Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization (Q5266534) (← links)
• A note about the complexity of minimizing Nesterov's smooth Chebyshev–Rosenbrock function (Q5299905) (← links)
• Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization (Q5853562) (← links)
• Solving the Cubic Regularization Model by a Nested Restarting Lanczos Method (Q5863879) (← links)
• Worst case complexity of direct search under convexity (Q5962720) (← links)
• Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization (Q6046826) (← links)
• An accelerated first-order method for non-convex optimization on manifolds (Q6048700) (← links)
• Two modified adaptive cubic regularization algorithms by using the nonmonotone Armijo-type line search (Q6062861) (← links)
• An adaptive regularization method in Banach spaces (Q6065217) (← links)
• Complexity bound of trust-region methods for convex smooth unconstrained multiobjective optimization (Q6097486) (← links)
• A filter sequential adaptive cubic regularization algorithm for nonlinear constrained optimization (Q6109884) (← links)
• An adaptive cubic regularization algorithm for computing H- and Z-eigenvalues of real even-order supersymmetric tensors (Q6114727) (← links)
• Newton-MR: inexact Newton method with minimum residual sub-problem solver (Q6114941) (← links)
• A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression (Q6114952) (← links)
• Convergence Properties of an Objective-Function-Free Optimization Regularization Algorithm, Including an \(\boldsymbol{\mathcal{O}(\epsilon^{-3/2})}\) Complexity Bound (Q6116246) (← links)
• A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees (Q6116250) (← links)
• A decentralized smoothing quadratic regularization algorithm for composite consensus optimization with non-Lipschitz singularities (Q6126602) (← links)
• Super-Universal Regularized Newton Method (Q6136654) (← links)
• On the complexity of a stochastic Levenberg-Marquardt method (Q6149301) (← links)
• The evaluation complexity of finding high-order minimizers of nonconvex optimization (Q6200212) (← links)
• Derivative-free separable quadratic modeling and cubic regularization for unconstrained optimization (Q6489314) (← links)
• Parameter-free accelerated gradient descent for nonconvex minimization (Q6561381) (← links)
• A Riemannian dimension-reduced second-order method with application in sensor network localization (Q6562381) (← links)
• Gradient descent in the absence of global Lipschitz continuity of the gradients (Q6583712) (← links)
• Inexact tensor methods and their application to stochastic convex optimization (Q6585820) (← links)
• Scalable adaptive cubic regularization methods (Q6608033) (← links)
• Convergent least-squares optimization methods for variational data assimilation (Q6632229) (← links)
• Hessian barrier algorithms for non-convex conic optimization (Q6665383) (← links)
• Perseus: a simple and optimal high-order method for variational inequalities (Q6665392) (← links)