A decomposition approach for global optimum search in QP, NLP and MINLP problems
From MaRDI portal
Publication:2638940
DOI10.1007/BF02283690zbMath0717.90059WikidataQ114859334 ScholiaQ114859334MaRDI QIDQ2638940
Avanish Aggarwal, Christodoulos A. Floudas
Publication date: 1990
Published in: Annals of Operations Research (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Decomposition methods (49M27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Solution of preemptive multi-objective network design problems applying Benders decomposition method, 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constrained global optimization: algorithms and applications
- Partitioning procedures for solving mixed-variables programming problems
- Generalized Benders decomposition
- APROS: Algorithmic Development Methodology for Discrete-Continuous Optimization Problems
- Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
- Jointly Constrained Biconvex Programming
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Global minimization of a difference of two convex functions
- An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
- Convergent Algorithms for Minimizing a Concave Function
- A Decomposition Strategy for Global Optimum Search in the Pooling Problem
- Global Maximization of a Convex Function with Linear Inequality Constraints
- An algorithm for nonconvex programming problems
- The bilinear programming problem
- A cutting plane algorithm for solving bilinear programs
- Maximization of A convex quadratic function under linear constraints
- A Successive Underestimation Method for Concave Minimization Problems
- The Indefinite Quadratic Programming Problem
- Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
- An Algorithm for Separable Nonconvex Programming Problems
- A Method for Solving the Indefinite Quadratic Programming Problem
- Sur les inégalités linéaires
- An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
