A dimension-reducing method for unconstrained optimization
type: Item
instance of: scholarly article
title: A dimension-reducing method for unconstrained optimization
zbMATH Open document ID: 0856.65074
DOI: 10.1016/0377-0427(95)00174-3
author: T. N. Grapsa
author: Michael N. Vrahatis
published in: Journal of Computational and Applied Mathematics
publication date: 1997-02-11T00:00:00Z
review text: For the unconstrained optimization problem \[ \min f(x),\;x\in\mathbb{R}^n \] a dimension-reducing numerical method is presented. The authors give for this method numerical applications and compare the obtained numerical result with conjugate gradient and variable metric methods.
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 908325
zbMATH Keywords: comparison of methods
zbMATH Keywords: conjugate gradient method
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: dimension-reducing numerical method
zbMATH Keywords: variable metric methods
reviewed by: Hans Benker
describes a project that uses: CHABIS
describes a project that uses: minpack
MaRDI profile type: Publication
full work available at URL: 0377-0427(95)00174-3
OpenAlex ID: W2078768543
cites work: Minimization of functions having Lipschitz continuous first partial derivatives
cites work: Some Efficient Algorithms for Solving Systems of Nonlinear Equations
cites work: Q5184361
cites work: Q3702408
cites work: The implicit function theorem for solving systems of nonlinear equations in
cites work: A dimension-reducing method for solving systems of nonlinear equations in
cites work: A new dimension—reducing method for solving systems of nonlinear equations
cites work: Solving systems of nonlinear equations In using a rotating hyperplane in
cites work: Locating and Computing All the Simple Roots and Extrema of a Function
cites work: A note on solution of nonlinear programming problems with imprecise function and gradient values
cites work: Testing Unconstrained Optimization Software
cites work: Q5661059
cites work: Q5652137
cites work: Q5287558
cites work: Bisection is optimal
cites work: Solving systems of nonlinear equations using the nonzero value of the topological degree
cites work: Algorithm 666: Chabis: a mathematical software package for locating and evaluating roots of systems of nonlinear equations
cites work: A Short Proof and a Generalization of Miranda's Existence Theorem
cites work: A new unconstrained optimization method for imprecise function and gradient values
description: scientific article; zbMATH DE number 908325