Modified \(r\)-algorithm to find the global minimum of polynomial functions
type: Item
instance of: scholarly article
title: Modified \(r\)-algorithm to find the global minimum of polynomial functions
zbMATH Open document ID: 0916.90248
DOI: 10.1007/BF02733104
published in: Cybernetics and Systems Analysis
publication date: 1999-04-28T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 1262970
zbMATH Keywords: global minimum of a polynomial
zbMATH Keywords: several variables
zbMATH Keywords: Lagrange function
zbMATH Keywords: redundant constraints
zbMATH Keywords: quadratic bounds
zbMATH Keywords: nonsmooth optimization
author: N. Z. Shor
author: P. I. Stetsyuk
MaRDI profile type: Publication
cites work: Constrained global optimization: algorithms and applications
cites work: An approach to obtaining global extremums in polynomial mathematical programming problems
cites work: Subspace kernels and minimum problems in Hilbert spaces with kernel function
cites work: Dual estimates in multiextremal problems
cites work: Q4880749
cites work: Q4300106
cites work: On the Shannon capacity of a graph
cites work: Orthogonalizing linear operators in convex programming. I, II
full work available at URL: https://doi.org/10.1007/bf02733104
OpenAlex ID: W2067277095
description: scientific article; zbMATH DE number 1262970