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

DOI10.1007/BF02733104zbMath0916.90248OpenAlexW2067277095MaRDI QIDQ1280905

Naum Z. Shor, Petro 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

nonsmooth optimizationseveral variablesLagrange functionredundant constraintsglobal minimum of a polynomialquadratic bounds

Mathematics Subject Classification ID

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

Related Items (19)

Approximate gcds of polynomials and sparse SOS relaxations ⋮ 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 ⋮ Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. I. Theoretical foundations ⋮ The polyhedral-surface cutting plane method of optimization over a vertex-located set ⋮ 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 ⋮ 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 ⋮ Sparse balanced layout of spherical voids in three-dimensional domains ⋮ 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 ⋮ Main directions in the development of informatics ⋮ Interindustry model of planned technological-structural changes ⋮ 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 ⋮ Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Constrained global optimization: algorithms and applications
• Dual estimates in multiextremal problems
• Orthogonalizing linear operators in convex programming. I, II
• Subspace kernels and minimum problems in Hilbert spaces with kernel function
• An approach to obtaining global extremums in polynomial mathematical programming problems
• On the Shannon capacity of a graph

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