Reduction of indefinite quadratic programs to bilinear programs
From MaRDI portal
Publication:1187369
DOI10.1007/BF00121301zbMath0786.90050MaRDI QIDQ1187369
Brigitte Jaumard, Pierre Hansen
Publication date: 13 August 1992
Published in: Journal of Global Optimization (Search for Journal in Brave)
Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (13)
A relaxation method for nonconvex quadratically constrained quadratic programs ⋮ Branch-reduction-bound algorithm for generalized geometric programming ⋮ A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation ⋮ Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations ⋮ A global optimization using linear relaxation for generalized geometric programming ⋮ A global optimization algorithm for signomial geometric programming problem ⋮ Global optimization of signomial geometric programming using linear relaxation. ⋮ Undercover: a primal MINLP heuristic exploring a largest sub-MIP ⋮ Multi-objective geometric programming problem with \(\epsilon\)-constraint method ⋮ Linearization method of global optimization for generalized geometric programming ⋮ A new two-level linear relaxed bound method for geometric programming problems ⋮ Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions ⋮ Primal-relaxed dual global optimization approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
- An exact algorithm for the maximum clique problem
- Global minimization of indefinite quadratic problems
- Constrained global optimization: algorithms and applications
- Convergence of interval-type algorithms for generalized fractional programming
- Test examples for nonlinear programming codes
- Generalized concavity
- A collection of test problems for constrained global optimization algorithms
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- A new reformulation-linearization technique for bilinear programming problems
- Linear multiplicative programming
- Some simplified NP-complete graph problems
- The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
- Generalized Benders decomposition
- Jointly Constrained Biconvex Programming
- An algorithm for finding the global maximum of a multimodal, multivariate function
- Methods for Global Concave Minimization: A Bibliographic Survey
- Finding a Maximum Clique in an Arbitrary Graph
- A Branch-and-Bound Method for Reversed Geometric Programming
- A resource decomposition algorithm for general mathematical programs
- Quadratically constrained quadratic programming: Some applications and a method for solution
- Global Minimization in Nonconvex All-Quadratic Programming
- A set of geometric programming test problems and their solutions
- Maximization of A convex quadratic function under linear constraints
- The Indefinite Quadratic Programming Problem
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- Quadratic programming with quadratic constraints
- Modular Design—A Special Case in Nonlinear Programming
This page was built for publication: Reduction of indefinite quadratic programs to bilinear programs
