Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization
From MaRDI portal
Publication:1675558
Recommendations
- The use of quadratic regularization with a cubic descent condition for unconstrained optimization
- Cubic regularization of Newton method and its global performance
- On global minimizers of quadratic functions with cubic regularization
- A cubic regularization of Newton's method with finite difference Hessian approximations
- Complexity bounds for second-order optimality in unconstrained optimization
Cites work
- A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization
- A Robust Trust-Region Algorithm with a Nonmonotonic Penalty Parameter Scheme for Constrained Optimization
- A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization
- A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
- Accelerating the cubic regularization of Newton's method on convex problems
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- Algebraic rules for quadratic regularization of Newton's method
- Cubic regularization of Newton method and its global performance
- scientific article; zbMATH DE number 3903874 (Why is no real title available?)
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
- Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters.
- On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
- On the use of iterative methods in cubic regularization for unconstrained optimization
- Practical augmented Lagrangian methods for constrained optimization
- Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization
- Updating the regularization parameter in the adaptive cubic regularization algorithm
Cited in
(46)- On the worst-case evaluation complexity of non-monotone line search algorithms
- A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- Cubic regularization in symmetric rank-1 quasi-Newton methods
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization
- Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization
- A generalized worst-case complexity analysis for non-monotone line searches
- An accelerated first-order method with complexity analysis for solving cubic regularization subproblems
- On large-scale unconstrained optimization and arbitrary regularization
- On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization
- A cubic regularization of Newton's method with finite difference Hessian approximations
- On the use of third-order models with fourth-order regularization for unconstrained optimization
- An efficient nonmonotone adaptive cubic regularization method with line search for unconstrained optimization problem
- A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds
- A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization
- Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization
- On global minimizers of quadratic functions with cubic regularization
- Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
- A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization
- Run-and-inspect method for nonconvex optimization and global optimality bounds for R-local minimizers
- Cubic regularization methods with second-order complexity guarantee based on a new subproblem reformulation
- A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization
- On High-order Model Regularization for Constrained Optimization
- On regularization and active-set methods with complexity for constrained optimization
- Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization
- Accelerated regularized Newton methods for minimizing composite convex functions
- On high-order model regularization for multiobjective optimization
- Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality
- A note on the worst-case complexity of nonlinear stepsize control methods for convex smooth unconstrained optimization
- A concise second-order complexity analysis for unconstrained optimization using high-order regularized models
- Stochastic variance-reduced cubic regularization methods
- Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact
- The use of quadratic regularization with a cubic descent condition for unconstrained optimization
- Regularized Newton methods for minimizing functions with Hölder continuous hessians
- Trust-region Newton-CG with strong second-order complexity guarantees for nonconvex optimization
- A filter sequential adaptive cubic regularization algorithm for nonlinear constrained optimization
- A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees
- A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees
- Adaptive Third-Order Methods for Composite Convex Optimization
- Gradient regularization of Newton method with Bregman distances
- Derivative-free separable quadratic modeling and cubic regularization for unconstrained optimization
- A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
- Second-order methods for quartically-regularised cubic polynomials, with applications to high-order tensor methods
- A line-search filter adaptive regularization algorithm using cubics based on affine scaling interior-point methods for constrained optimization
- Cubic-quartic regularization models for solving polynomial subproblems in third-order tensor methods
- An adaptive cubic regularisation algorithm based on interior-point methods for optimization with general inequality constraints
This page was built for publication: Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675558)
