Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization
type: Item
instance of: scholarly article
title: Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization
zbMATH Open document ID: 1353.90147
author: M. Raydan
author: J. M. Martínez
published in: Journal of Global Optimization
publication date: 2015-10-20T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6496853
zbMATH Keywords: smooth unconstrained minimization
zbMATH Keywords: cubic modeling
zbMATH Keywords: trust-region strategies
zbMATH Keywords: Newton-type methods
describes a project that uses: dqed
describes a project that uses: KELLEY
describes a project that uses: GQTPAR
describes a project that uses: Packmol
MaRDI profile type: Publication
full work available at URL: s10898-015-0278-3
OpenAlex ID: W2004427728
cites work: Interior-point methods for nonconvex nonlinear programming: cubic regularization
cites work: On the use of iterative methods in cubic regularization for unconstrained optimization
cites work: Nonmonotone Spectral Projected Gradient Methods on Convex Sets
cites work: Cubic regularization of Newton method and its global performance
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: On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization
cites work: Trust Region Methods
cites work: Q4868581
cites work: Q4226179
cites work: Computing Optimal Locally Constrained Steps
cites work: Updating the regularization parameter in the adaptive cubic regularization algorithm
cites work: A quadratic-tensor model algorithm for nonlinear least-squares problems with linear constraints
cites work: Algebraic rules for quadratic regularization of Newton's method
cites work: Q4237537
cites work: A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
cites work: Computing a Trust Region Step
cites work: Accelerating the cubic regularization of Newton's method on convex problems
cites work: Q5491447
cites work: Tensor Methods for Unconstrained Optimization Using Second Derivatives
cites work: Tensor Methods for Nonlinear Equations
cites work: A subspace implementation of quasi-Newton trust region methods for unconstrained optimization
DOI: 10.1007/S10898-015-0278-3
description: scientific article; zbMATH DE number 6496853