A new algorithm for box-constrained global optimization
From MaRDI portal
Recommendations
- A deterministic approach to global box-constrained optimization
- scientific article; zbMATH DE number 1795203
- scientific article; zbMATH DE number 2094782
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- A branch-and-bound algorithm for bound constrained optimization problems without derivatives
Cites work
- scientific article; zbMATH DE number 3529352 (Why is no real title available?)
- A hybrid descent method for global optimization
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- A review of recent advances in global optimization
- A unifying approach to the construction of circulant preconditioners
- Computational experience with a new class of convex underestimators: Box-constrained NLP problems
- Convergence Conditions for Ascent Methods
- Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
- Convexity of products of univariate functions and convexification transformations for geometric programming
- Deterministic global optimization in nonlinear optimal control problems
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Low complexity secant quasi-Newton minimization algorithms for nonconvex functions
- Low‐complexity minimization algorithms
- Matrix algebras in quasi-Newton methods for unconstrained minimization
- Numerical Optimization
- Primal-relaxed dual global optimization approach
- TRUST: A Deterministic Algorithm for Global Optimization
- Terminal repeller unconstrained subenergy tunneling (TRUST) for fast global optimization
- The Tunneling Algorithm for the Global Minimization of Functions
- Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
- Unconventional initialization methods for differential evolution
Cited in
(6)- Interval Methods for Global Optimization Using the Boxing Method
- New algorithms for maximization of concave functions with box constraints
- Gradient-type methods: a unified perspective in computer science and numerical analysis
- Erratum to: ``A hybrid genetic algorithm for a class of global optimization problems with box constraints
- Generating box-constrained optimization problems
- A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions
This page was built for publication: A new algorithm for box-constrained global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q639210)
