Combination of two underestimators for univariate global optimization
From MaRDI portal
Publication:4579891
Recommendations
- New underestimator for univariate global optimization
- Global minimization via piecewise-linear underestimation
- Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
- Extended univariate algorithms for n-dimensional global optimization
- Unconstrained global optimization using stochastic intergral equations
- A Novel Uncertainty Quantification Method for Efficient Global Optimization
- Quadratic Combinatorial Optimization Using Separable Underestimators
- Global optimization of redescending robust estimators
- Nonconvex piecewise-quadratic underestimation for global minimization
- Publication:3486658
Cites work
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- A practical guide to splines
- A review of recent advances in global optimization
- An information global minimization algorithm using the local improvement technique
- Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
- Finite exact branch-and-bound algorithms for concave minimization over polytopes
- New interval analysis support functions using gradient information in a global minimization algorithm
- New quadratic lower bound for multivariate functions in global optimization
- Optimal centers in branch-and-prune algorithms for univariate global optimization
- Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
Cited in
(6)- Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
- New technique for solving univariate global optimization.
- New underestimator for univariate global optimization
- Performance of convex underestimators in a branch-and-bound framework
- A new improved convex underestimator for univariate functions in global optimization
- Tighter underestimator for bivariate global optimization
This page was built for publication: Combination of two underestimators for univariate global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579891)