A decomposition approach for global optimum search in QP, NLP and MINLP problems

DOI10.1007/BF02283690zbMath0717.90059WikidataQ114859334 ScholiaQ114859334MaRDI QIDQ2638940

Christodoulos A. Floudas, Avanish Aggarwal

Publication date: 1990

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

decomposition of the constraint set

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C26: Nonconvex programming, global optimization

90C20: Quadratic programming

49M27: Decomposition methods

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints, Primal-relaxed dual global optimization approach

Uses Software

• GAMS
• MINOS