Optimization by space‐densifying curves as a natural generalization of the Alienor method

DOI10.1108/03684920010333170zbMath1169.90456OpenAlexW2013940945MaRDI QIDQ2776880

Gaspar Mora

Publication date: 30 July 2002

Published in: Kybernetes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1108/03684920010333170

Mathematics Subject Classification ID

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

Related Items (8)

Global optimization‐preserving operators ⋮ Approximating the attractor set of countable iterated function systems by \(\alpha\)-dense curves ⋮ Integer optimization by α‐dense curves ⋮ BOX-COUNTING DIMENSION COMPUTED BY α-DENSE CURVES ⋮ Approximating the attractor set of iterated function systems of order \(m\) by \(\alpha\)-dense curves ⋮ Densifiable metric spaces ⋮ A new approach to the reduction of multiple integrals to simple ones using Chebyshev's kernels ⋮ Existence of solutions for infinite systems of differential equations by densifiability techniques

Uses Software

• Global Optimization Toolbox For Maple

Cites Work

• Approximation of a several variables function by a one variable function and application to global optimization
• Characterization and generation of \(\alpha\)-dense curves
• TRUST: A Deterministic Algorithm for Global Optimization
• A New Method for Global Optimisation (Alienor)
• An approximation method for the optimization of continuous functions ofnvariables by densifying their domains
• The theoretic calculation time associated to α‐dense curves
• The existence of α‐dense curves with minimal length in a metric space
• On the minimal length curve that densifies the square

This page was built for publication: Optimization by space‐densifying curves as a natural generalization of the Alienor method