scientific article; zbMATH DE number 1543292
From MaRDI portal
Publication:4520756
Recommendations
- Algorithme d'encadrement de l'optimum global d'une fonction différentiable
- A multivariate global optimization using linear bounding functions
- Multidimensional global optimization using numerical estimates of objective function derivatives
- Global optimization of multivariable functions satisfying the Vanderbei condition
- A global optimization algorithm for multivariate functions with Lipschitzian first derivatives
- A continuously differentiable filled function method for global optimization
- Approximation of a several variables function by a one variable function and application to global optimization
- Globally convergent methods for n-dimensional multiextremal optimization
- scientific article; zbMATH DE number 4123538
Cited in
(21)- The cluster problem in multivariate global optimization
- On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic
- A multidimensional branch-and-prune method for interval global optimization
- On interval branch-and-bound for additively separable functions with common variables
- Constrained global optimization for wine blending
- Extremal problems for convex polygons
- A general reliable quadratic form: An extension of affine arithmetic
- A new inclusion function for optimization: kite -- the one-dimensional case
- Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
- Efficiency of a Global Optimization Algorithm
- Algorithme d'encadrement de l'optimum global d'une fonction différentiable
- Upper bounding in inner regions for global optimization under inequality constraints
- scientific article; zbMATH DE number 852336 (Why is no real title available?)
- Extensions of affine arithmetic: application to unconstrained global optimization
- Deterministic global optimization using interval constraint propagation techniques
- Node selection strategies in interval branch and bound algorithms
- A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms
- Theoretical rate of convergence for interval inclusion functions
- The small octagon with longest perimeter
- Adaptive constructive interval disjunction: algorithms and experiments
- Comparison between Baumann and admissible simplex forms in interval analysis
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4520756)
