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

DOI10.1007/S10898-005-4386-3MaRDI QIDQ2494301zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1054663
• scientific article; zbMATH DE number 1054665
• A branch and bound algorithm for globally solving a class of nonconvex programming problems
• scientific article; zbMATH DE number 1054667
• A branch and bound algorithm for a class of non-convex programming problems

Cites work

• scientific article; zbMATH DE number 3598385 (Why is no real title available?)
• A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
• A branch-and-reduce approach to global optimization
• A global optimization algorithm for linear fractional and bilinear programs
• A new reformulation-linearization technique for bilinear programming problems
• An analytical approach to global optimization
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Finding all solutions of nonlinearly constrained systems of equations
• Primal-relaxed dual global optimization approach
• Semidefinite relaxations of fractional programs via novel convexification techniques
• \(\alpha BB\): A global optimization method for general constrained nonconvex problems

Cited in

(6)

• Algorithm for solving NLP problems with the use of a modified Lagrange function
• A review of recent advances in global optimization
• On the Performance of NLP Solvers Within Global MINLP Solvers
• An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
• scientific article; zbMATH DE number 1078157 (Why is no real title available?)
• Domain reduction techniques for global NLP and MINLP optimization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494301)