Pages that link to "Item:Q1280905"

The following pages link to Modified \(r\)-algorithm to find the global minimum of polynomial functions (Q1280905):

Displaying 21 items.

• On the global minimum in a balanced circular packing problem (Q315515) (← links)
• Maximum consistency method for data fitting under interval uncertainty (Q330508) (← links)
• On N. Z. Shor's three scientific ideas (Q380646) (← links)
• Theory and software implementations of Shor's \(r\)-algorithms (Q681720) (← links)
• Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems (Q681722) (← links)
• Norm bounds and underestimators for unconstrained polynomial integer minimization (Q684153) (← links)
• 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 (Q747294) (← links)
• Balance layout problem for 3D-objects: mathematical model and solution methods (Q747302) (← links)
• Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. I. Theoretical foundations (Q891710) (← links)
• Models and information technologies for decision support during structural and technological changes (Q1040369) (← links)
• Solution of continuous problems of optimal covering with spheres using optimal set-partition theory (Q1040406) (← links)
• Main directions in the development of informatics (Q1280975) (← links)
• Interindustry model of planned technological-structural changes (Q1286300) (← links)
• Lagrangian bounds in multiextremal polynomial and discrete optimization problems (Q1598884) (← links)
• An adaptive procedure for the global minimization of a class of polynomial functions (Q2004881) (← links)
• Sparse balanced layout of spherical voids in three-dimensional domains (Q2044059) (← links)
• Generating valid linear inequalities for nonlinear programs via sums of squares (Q2198537) (← links)
• Constructing the external contour of the Frankl nozzle using S-shaped curves with quadratic distribution of the curvature (Q2215879) (← links)
• Approximate gcds of polynomials and sparse SOS relaxations (Q2378493) (← links)
• Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization (Q3133922) (← links)
• (Q5400057) (← links)