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 50 items.

• A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron (Q304258) (← links)
• A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization (Q429459) (← links)
• Interior-point methods for nonconvex nonlinear programming: cubic regularization (Q457205) (← links)
• On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization (Q494338) (← links)
• Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality (Q504812) (← links)
• A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization (Q517288) (← links)
• An inexact proximal regularization method for unconstrained optimization (Q522090) (← links)
• Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models (Q526842) (← links)
• Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity (Q652287) (← links)
• Complexity bounds for second-order optimality in unconstrained optimization (Q657654) (← links)
• Updating the regularization parameter in the adaptive cubic regularization algorithm (Q694543) (← links)
• Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization (Q746819) (← links)
• On solving trust-region and other regularised subproblems in optimization (Q977328) (← links)
• A new regularized quasi-Newton algorithm for unconstrained optimization (Q1636866) (← links)
• Global convergence rate analysis of unconstrained optimization methods based on probabilistic models (Q1646566) (← links)
• Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization (Q1675558) (← links)
• Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions (Q1683689) (← links)
• On the use of the energy norm in trust-region and adaptive cubic regularization subproblems (Q1694391) (← links)
• A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis (Q1730832) (← links)
• Cubic regularization in symmetric rank-1 quasi-Newton methods (Q1741108) (← links)
• A new augmented Lagrangian method for equality constrained optimization with simple unconstrained subproblem (Q1784887) (← links)
• Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization (Q1785005) (← links)
• Preconditioning and globalizing conjugate gradients in dual space for quadratically penalized nonlinear-least squares problems (Q1938916) (← links)
• Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization (Q2001208) (← links)
• A Newton-like trust region method for large-scale unconstrained nonconvex minimization (Q2015579) (← links)
• Regional complexity analysis of algorithms for nonconvex smooth optimization (Q2020615) (← links)
• Minimizing uniformly convex functions by cubic regularization of Newton method (Q2032037) (← links)
• Adaptive regularization with cubics on manifolds (Q2039233) (← links)
• New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization (Q2041515) (← links)
• An accelerated first-order method with complexity analysis for solving cubic regularization subproblems (Q2044484) (← links)
• On large-scale unconstrained optimization and arbitrary regularization (Q2070329) (← links)
• An adaptive high order method for finding third-order critical points of nonconvex optimization (Q2079692) (← links)
• On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (Q2089862) (← links)
• On local nonglobal minimum of trust-region subproblem and extension (Q2093294) (← links)
• Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems (Q2098802) (← links)
• \(\rho\)-regularization subproblems: strong duality and an eigensolver-based algorithm (Q2114814) (← links)
• Local convergence of tensor methods (Q2133417) (← links)
• A cubic regularization of Newton's method with finite difference Hessian approximations (Q2138398) (← links)
• Smoothness parameter of power of Euclidean norm (Q2178876) (← links)
• On the use of third-order models with fourth-order regularization for unconstrained optimization (Q2182770) (← links)
• On monotonic estimates of the norm of the minimizers of regularized quadratic functions in Krylov spaces (Q2192591) (← links)
• Finding second-order stationary points in constrained minimization: a feasible direction approach (Q2194125) (← links)
• Newton-type methods for non-convex optimization under inexact Hessian information (Q2205970) (← links)
• Implementable tensor methods in unconstrained convex optimization (Q2227532) (← links)
• Projected adaptive cubic regularization algorithm with derivative-free filter technique for box constrained optimization (Q2244360) (← links)
• An efficient nonmonotone adaptive cubic regularization method with line search for unconstrained optimization problem (Q2275169) (← links)
• A note on inexact gradient and Hessian conditions for cubic regularized Newton's method (Q2294286) (← links)
• A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization (Q2297654) (← links)
• Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization (Q2301133) (← links)
• Combining stochastic adaptive cubic regularization with negative curvature for nonconvex optimization (Q2302838) (← links)