Pages that link to "Item:Q535013"

The following pages link to Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results (Q535013):

Displaying 47 items.

• Solving Large-Scale Cubic Regularization by a Generalized Eigenvalue Problem (Q5148399) (← links)
• Convergence of Newton-MR under Inexact Hessian Information (Q5148404) (← links)
• Smoothing quadratic regularization method for hemivariational inequalities (Q5151500) (← links)
• An SQP Method for Equality Constrained Optimization on Hilbert Manifolds (Q5152479) (← links)
• On the Complexity of an Inexact Restoration Method for Constrained Optimization (Q5210514) (← links)
• A concise second-order complexity analysis for unconstrained optimization using high-order regularized models (Q5210739) (← links)
• Error estimates for iterative algorithms for minimizing regularized quadratic subproblems (Q5210741) (← links)
• (Q5214226) (← 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)
• An adaptive nonmonotone trust region method based on a modified scalar approximation of the Hessian in the successive quadratic subproblems (Q5242267) (← 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)
• Regularized Newton Methods for Minimizing Functions with Hölder Continuous Hessians (Q5737717) (← links)
• Optimal control of static contact in finite strain elasticity (Q5854387) (← links)
• Solving the Cubic Regularization Model by a Nested Restarting Lanczos Method (Q5863879) (← links)
• A Unified Efficient Implementation of Trust-region Type Algorithms for Unconstrained Optimization (Q5882393) (← links)
• Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization (Q6046826) (← links)
• Two modified adaptive cubic regularization algorithms by using the nonmonotone Armijo-type line search (Q6062861) (← links)
• A fast and simple modification of Newton's method avoiding saddle points (Q6086150) (← 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)
• A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees (Q6114780) (← links)
• Newton-MR: inexact Newton method with minimum residual sub-problem solver (Q6114941) (← links)
• Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence (Q6116237) (← links)
• Convergence Properties of an Objective-Function-Free Optimization Regularization Algorithm, Including an \(\boldsymbol{\mathcal{O}(\epsilon^{-3/2})}\) Complexity Bound (Q6116246) (← links)
• A decentralized smoothing quadratic regularization algorithm for composite consensus optimization with non-Lipschitz singularities (Q6126602) (← links)
• Faster Riemannian Newton-type optimization by subsampling and cubic regularization (Q6134379) (← links)
• Super-Universal Regularized Newton Method (Q6136654) (← links)
• Quadratic regularization methods with finite-difference gradient approximations (Q6175465) (← links)
• Gradient regularization of Newton method with Bregman distances (Q6201850) (← 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)
• Set-limited functions and polynomial-time interior-point methods (Q6596326) (← links)
• Scalable adaptive cubic regularization methods (Q6608033) (← links)
• A new complexity metric for nonconvex rank-one generalized matrix completion (Q6608034) (← links)
• Correction of nonmonotone trust region algorithm based on a modified diagonal regularized quasi-Newton method (Q6609629) (← links)
• Convergent least-squares optimization methods for variational data assimilation (Q6632229) (← links)
• A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization (Q6642793) (← links)
• Trust region-type method under inexact gradient and inexact Hessian with convergence analysis (Q6665208) (← links)
• Hessian barrier algorithms for non-convex conic optimization (Q6665383) (← links)
• Perseus: a simple and optimal high-order method for variational inequalities (Q6665392) (← links)
• On convergence of the generalized Lanczos trust-region method for trust-region subproblems (Q6667676) (← links)