Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization
type: Item
instance of: scholarly article
title: Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization
zbMATH Open document ID: 1379.90029
published in: Journal of Global Optimization
publication date: 2017-11-02T00:00:00Z
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6802490
zbMATH Keywords: smooth unconstrained minimization
zbMATH Keywords: cubic modeling
zbMATH Keywords: regularization
zbMATH Keywords: Newton-type methods
author: J. M. Martínez
author: M. Raydan
describes a project that uses: ALGENCAN
MaRDI profile type: Publication
full work available at URL: s10898-016-0475-8
OpenAlex ID: W2530585400
cites work: On the use of iterative methods in cubic regularization for unconstrained optimization
cites work: Practical Augmented Lagrangian Methods for Constrained Optimization
cites work: On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems
cites work: Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
cites work: Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
cites work: Q3681854
cites work: A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization
cites work: A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization
cites work: A Robust Trust-Region Algorithm with a Nonmonotonic Penalty Parameter Scheme for Constrained Optimization
cites work: Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters.
cites work: On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
cites work: Updating the regularization parameter in the adaptive cubic regularization algorithm
cites work: Algebraic rules for quadratic regularization of Newton's method
cites work: A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
cites work: Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
cites work: Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization
cites work: Cubic regularization of Newton method and its global performance
cites work: Accelerating the cubic regularization of Newton's method on convex problems
DOI: 10.1007/S10898-016-0475-8
description: scientific article; zbMATH DE number 6802490