New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints

DOI10.1007/BF01096414zbMath0795.90070MaRDI QIDQ1310977

V. Visweswaran, Christodoulos A. Floudas

Publication date: 14 September 1994

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

zbMATH Keywords

global optimizationnonconvex optimizationblendingGOP algorithmindefinite quadratic problemmultiperiod tankage quality problem

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Quadratic programming (90C20)

Related Items

A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation, A relaxation method for nonconvex quadratically constrained quadratic programs, Partly convex programming and Zermelo's navigation problems, An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms, A reformulation-convexification approach for solving nonconvex quadratic programming problems, Large-scale standard pooling problems with constrained pools and fixed demands, \(\alpha BB\): A global optimization method for general constrained nonconvex problems, Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness, A computational study of global optimization solvers on two trust region subproblems, A Decomposition-Based Heuristic for Collaborative Scheduling in a Network of Open-Pit Mines, Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems, Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations, Decomposition strategy for the stochastic pooling problem, Solution to singular optimal control by backward differential flow, Unconstrained and constrained global optimization of polynomial functions in one variable, New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation, Biconvex sets and optimization with biconvex functions: a survey and extensions, Global solution of non-convex quadratically constrained quadratic programs, New multi-commodity flow formulations for the pooling problem, A global supply chain model with transfer pricing and transportation cost allocation, Bilevel optimization applied to strategic pricing in competitive electricity markets, Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming, Convergence of the (GOP) algorithm for a large class of smooth optimization problems, A new Lagrangean approach to the pooling problem, Generalized primal-relaxed dual approach for global optimization, A remark on the GOP algorithm for global optimization, Global minimum potential energy conformations of small molecules, Primal-relaxed dual global optimization approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Jointly constrained bilinear programs and related problems: An overview
• On the convergence of global methods in multiextremal optimization
• Global minimization of indefinite quadratic problems
• A parallel algorithm for constrained concave quadratic global minimization
• An analytical approach to global optimization
• Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming
• A collection of test problems for constrained global optimization algorithms
• Global optimization of univariate Lipschitz functions. I: Survey and properties
• Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison
• Global optimization using interval analysis: The one-dimensional case
• Primal-relaxed dual global optimization approach
• Global minimization by reducing the duality gap
• Generalized Benders decomposition
• A decomposition approach for global optimum search in QP, NLP and MINLP problems
• Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
• Jointly Constrained Biconvex Programming
• A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
• The Tunneling Algorithm for the Global Minimization of Functions
• Methods for Global Concave Minimization: A Bibliographic Survey
• Stochastic global optimization methods part I: Clustering methods
• A Decomposition Strategy for Global Optimum Search in the Pooling Problem
• An algorithm for finding the absolute extremum of a function
• Global optimization