Improve-and-branch algorithm for the global optimization of nonconvex NLP problems

DOI10.1007/s10898-005-4386-3zbMath1098.90094OpenAlexW2042642065MaRDI QIDQ2494301

Marian G. Marcovecchio, María L. Bergamini, Pío A. Aguirre

Publication date: 26 June 2006

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-005-4386-3

zbMATH Keywords

convex hullconcave termsunderestimating problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Related Items (1)

A review of recent advances in global optimization

Cites Work

• Unnamed Item
• An analytical approach to global optimization
• A new reformulation-linearization technique for bilinear programming problems
• A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
• Primal-relaxed dual global optimization approach
• A global optimization algorithm for linear fractional and bilinear programs
• Finding all solutions of nonlinearly constrained systems of equations
• \(\alpha BB\): A global optimization method for general constrained nonconvex problems
• A branch-and-reduce approach to global optimization
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Semidefinite relaxations of fractional programs via novel convexification techniques

This page was built for publication: Improve-and-branch algorithm for the global optimization of nonconvex NLP problems