New underestimator for univariate global optimization
From MaRDI portal
(Redirected from Publication:5357003)
Recommendations
- Combination of two underestimators for univariate global optimization
- Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
- New methods for calculating \(\alpha\)BB-type underestimators
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
- New technique for solving univariate global optimization.
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
- Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
- New quadratic lower bound for multivariate functions in global optimization
Cited in
(9)- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
- Computational experience with a new class of convex underestimators: Box-constrained NLP problems
- Safe and tight linear estimators for global optimization
- Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
- Combination of two underestimators for univariate global optimization
- Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization
- New technique for solving univariate global optimization.
- An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices
- A new global optimization method for univariate constrained twice-differentiable NLP problems
This page was built for publication: New underestimator for univariate global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5357003)