Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint

@article{Thi2006ConvexQU,
  title={Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint},
  author={Hoai An Le Thi and M. Ouanes},
  journal={RAIRO Oper. Res.},
  year={2006},
  volume={40},
  pages={285-302}
}
The purpose of this paper is to demonstrate that, for globally minimize one dimensional nonconvex problems with both twice differentiable function and constraint, we can propose an efficient algorithm based on Branch and Bound techniques. The method is first displayed in the simple case with an interval constraint. The extension is displayed afterwards to the general case with an additional nonconvex twice differentiable constraint. A quadratic bounding function which is better than the… Expand
17 Citations
New quadratic lower bound for multivariate functions in global optimization
  • 7
New technique for solving univariate global optimization
  • 1
  • PDF
A branch and bound approach for convex semi-infinite programming
  • PDF
A branch and bound approach for convex semi-innite programming
A NEW APPROACH FOR NONCONVEX SIP
  • 2
  • PDF
New Underestimator for Univariate Global Optimization
Combination of two underestimators for univariate global optimization
...
1
2
...

References

SHOWING 1-10 OF 40 REFERENCES
An Algorithm for Separable Nonconvex Programming Problems
  • 393
Global Optimization: Deterministic Approaches
  • 1,735
Global one-dimensional optimization using smooth auxiliary functions
  • Y. Sergeyev
  • Mathematics, Computer Science
  • Math. Program.
  • 1998
  • 70
A global optimization algorithm (GOP) for certain classes of nonconvex NLPs—I. Theory
  • 256
  • Highly Influential
An improved univariate global optimization algorithm with improved linear lower bounding functions
  • 5
  • Highly Influential
Global optimization of Hölder functions
  • 18
  • Highly Influential
...
1
2
3
4
...