Modified r-algorithm to find the global minimum of polynomial functions

DOI10.1007/BF02733104MaRDI QIDQ1280905zbMATH OpenOpenAlexFDO

Authors N. Z. Shor, P. I. Stetsyuk

Publication date 28 April 1999

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02733104

zbMATH Keywords

global minimum of a polynomialLagrange functionnonsmooth optimizationquadratic boundsredundant constraintsseveral variables

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• Role of redundant constraints for improving dual bounds in polynomial optimization problems
• Global minimization of a multivariate polynomial using matrix methods
• On global optimizations with polynomials
• Global optimization with polynomials and the problem of moments

Cites work

• An approach to obtaining global extremums in polynomial mathematical programming problems
• Constrained global optimization: algorithms and applications
• Dual estimates in multiextremal problems
• scientific article; zbMATH DE number 605180 (Why is no real title available?)
• scientific article; zbMATH DE number 892026 (Why is no real title available?)
• On the Shannon capacity of a graph
• Orthogonalizing linear operators in convex programming. I, II
• Subspace kernels and minimum problems in Hilbert spaces with kernel function

Cited in

(24)

• Models and information technologies for decision support during structural and technological changes
• Solution of continuous problems of optimal covering with spheres using optimal set-partition theory
• Main directions in the development of informatics
• Interindustry model of planned technological-structural changes
• Lagrangian bounds in multiextremal polynomial and discrete optimization problems
• An adaptive procedure for the global minimization of a class of polynomial functions
• Sparse balanced layout of spherical voids in three-dimensional domains
• Generating valid linear inequalities for nonlinear programs via sums of squares
• Constructing the external contour of the Frankl nozzle using S-shaped curves with quadratic distribution of the curvature
• Approximate gcds of polynomials and sparse SOS relaxations
• Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
• On the global minimum in a balanced circular packing problem
• Maximum consistency method for data fitting under interval uncertainty
• On N. Z. Shor's three scientific ideas
• Global Minimization of Normal Quartic Polynomials Based on Global Descent Directions
• scientific article; zbMATH DE number 6263860 (Why is no real title available?)
• The polyhedral-surface cutting plane method of optimization over a vertex-located set
• Theory and software implementations of Shor's r-algorithms
• Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems
• Norm bounds and underestimators for unconstrained polynomial integer minimization
• Scientific legacy of academician N. Z. Shor
• Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. II: Algorithms for constructing Voronoi diagrams based on the theory of optimal set partitioning
• Balance layout problem for 3D-objects: mathematical model and solution methods
• Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. I. Theoretical foundations

This page was built for publication: Modified \(r\)-algorithm to find the global minimum of polynomial functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1280905)