A new algorithm for box-constrained global optimization
From MaRDI portal
Publication:639210
DOI10.1007/S10957-010-9780-4zbMath1221.90073OpenAlexW2129586721MaRDI QIDQ639210
Publication date: 18 September 2011
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-010-9780-4
Related Items (1)
Cites Work
- Unnamed Item
- A review of recent advances in global optimization
- A unifying approach to the construction of circulant preconditioners
- Convexity of products of univariate functions and convexification transformations for geometric programming
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
- Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
- Terminal repeller unconstrained subenergy tunneling (TRUST) for fast global optimization
- Primal-relaxed dual global optimization approach
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Matrix algebras in quasi-Newton methods for unconstrained minimization
- Computational experience with a new class of convex underestimators: Box-constrained NLP problems
- A hybrid descent method for global optimization
- Unconventional initialization methods for differential evolution
- Low complexity secant quasi-Newton minimization algorithms for nonconvex functions
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
- TRUST: A Deterministic Algorithm for Global Optimization
- Low‐complexity minimization algorithms
- The Tunneling Algorithm for the Global Minimization of Functions
- Numerical Optimization
- Convergence Conditions for Ascent Methods
- Deterministic global optimization in nonlinear optimal control problems
This page was built for publication: A new algorithm for box-constrained global optimization
