A global optimization method, QBB, for twice-differentiable nonconvex optimization problem
DOI10.1007/S10898-005-0936-YzbMATH Open1093.90090OpenAlexW2021381008MaRDI QIDQ811896FDOQ811896
Authors: Yushan Zhu, Takahito Kuno 
Publication date: 23 January 2006
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-005-0936-y
Recommendations
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- A new global optimization method for univariate constrained twice-differentiable NLP problems
- scientific article; zbMATH DE number 1795203
- Rigorous convex underestimators for general twice-differentiable problems
- A global optimization algorithm for generalized quadratic programming
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Cites Work
- BARON: A general purpose global optimization software package
- Convex extensions and envelopes of lower semi-continuous functions
- Semidefinite relaxations of fractional programs via novel convexification techniques
- Global minimum potential energy conformations of small molecules
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Global optimization of multiplicative programs
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A branch-and-reduce approach to global optimization
- Primal-relaxed dual global optimization approach
- Decomposition based and branch and bound global optimization approaches for the phase equilibrium problem
- Second-order sufficient optimality conditions for local and global nonlinear programming
- The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
Cited In (5)
- A new technique to derive tight convex underestimators (sometimes envelopes)
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
- On the efficient Gerschgorin inclusion usage in the global optimization \(\alpha\)BB method
- A practical but rigorous approach to sum-of-ratios optimization in geometric applications
- Title not available (Why is that?)
Uses Software
This page was built for publication: A global optimization method, QBB, for twice-differentiable nonconvex optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q811896)
