Algorithms for multi-extremal mathematical programming problems employing the set of joint space-filling curves
From MaRDI portal
Publication:1201903
DOI10.1007/BF00122428zbMath0767.90080OpenAlexW2057394440MaRDI QIDQ1201903
Publication date: 17 January 1993
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00122428
global convergencemulti-extremal non-convex-constrained optimizationPeano-type space- filling curves
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Test problem generator for unconstrained global optimization ⋮ An adaptive stochastic global optimization algorithm for one-dimensional functions ⋮ New LP bound in multivariate Lipschitz optimization: Theory and applications ⋮ An algorithm for solving global optimization problems with nonlinear constraints ⋮ Generalized parallel computational schemes for time-consuming global optimization ⋮ Reduction of multi-extremum multi-criterion problems with constraints to unconstrained optimization problems: Theory and algorithms ⋮ Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems ⋮ An information global minimization algorithm using the local improvement technique ⋮ A genetic algorithm for a global optimization problem arising in the detection of gravitational waves ⋮ Unnamed Item ⋮ Generating $\alpha $-dense curves in non-convex sets to solve a class of non-smooth constrained global optimization ⋮ Lipschitz and Hölder global optimization using space-filling curves ⋮ On tightness and anchoring of McCormick and other relaxations ⋮ Novel global optimization algorithm with a space-filling curve and integral function
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bayesian methods in global optimization
- On Timonov's algorithm for global optimization of univariate Lipschitz functions
- A global minimization algorithm with parallel iterations
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- Minimization of multiextremal functions under nonconvex constraints
- Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
- A method for solving multi-extremal problems with non-convex constraints, that uses a priori information about estimates of the optimum
- The information approach to multiextremal optimization problems
- Best sequential search strategies for finding an extremum
- An algorithm for finding the absolute extremum of a function
- Space filling curves and mathematical programming
- Alternative Algorithm for Hilbert's Space-Filling Curve
