Pages that link to "Item:Q440675"

The following pages link to On strong homogeneity of two global optimization algorithms based on statistical models of multimodal objective functions (Q440675):

Displayed 26 items.

• On local search in d.c. optimization problems (Q299416) ‎ (← links)
• Solving ordinary differential equations on the Infinity Computer by working with infinitesimals numerically (Q470915) ‎ (← links)
• Application of reduced-set Pareto-Lipschitzian optimization to truss optimization (Q506481) ‎ (← links)
• Improving the convergence rate of the DIRECT global optimization algorithm (Q522279) ‎ (← links)
• The Olympic medals ranks, lexicographic ordering, and numerical infinities (Q897011) ‎ (← links)
• Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming (Q1790671) ‎ (← links)
• The DIRECT algorithm: 25 years later (Q2022319) ‎ (← links)
• Simulation of hybrid systems under Zeno behavior using numerical infinitesimals (Q2137361) ‎ (← links)
• Some paradoxes of infinity revisited (Q2148333) ‎ (← links)
• On the use of the infinity computer architecture to set up a dynamic precision floating-point arithmetic (Q2156894) ‎ (← links)
• Infinite numerical computing applied to Hilbert's, Peano's, and Moore's curves (Q2188296) ‎ (← links)
• The exact (up to infinitesimals) infinite perimeter of the Koch snowflake and its finite area (Q2199469) ‎ (← links)
• On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales (Q2205849) ‎ (← links)
• A new approach to the \(Z\)-transform through infinite computation (Q2207702) ‎ (← links)
• The exact measures of the Sierpiński \(d\)-dimensional tetrahedron in connection with a Diophantine nonlinear system (Q2207944) ‎ (← links)
• A generalized Taylor method of order three for the solution of initial value problems in standard and infinity floating-point arithmetic (Q2229113) ‎ (← links)
• A Simulink-based software solution using the infinity computer methodology for higher order differentiation (Q2244122) ‎ (← links)
• Simplicial Lipschitz optimization without the Lipschitz constant (Q2249819) ‎ (← links)
• Globally-biased disimpl algorithm for expensive global optimization (Q2250095) ‎ (← links)
• Nonlinear programming and grossone: quadratic programing and the role of constraint qualifications (Q2422876) ‎ (← links)
• Lexicographic multi-objective linear programming using grossone methodology: theory and algorithm (Q2422877) ‎ (← links)
• Numerical infinitesimals in a variable metric method for convex nonsmooth optimization (Q2422878) ‎ (← links)
• The Sierpinski curve viewed by numerical computations with infinities and infinitesimals (Q2422879) ‎ (← links)
• On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization (Q2660812) ‎ (← links)
• Computations with Grossone-Based Infinities (Q2945558) ‎ (← links)
• Branch and probability bound methods in multi-objective optimization (Q5963235) ‎ (← links)