A novel optimization method for nonconvex quadratically constrained quadratic programs
From MaRDI portal
Publication:1724769
DOI10.1155/2014/698489zbMath1474.90318OpenAlexW2138597195WikidataQ59040728 ScholiaQ59040728MaRDI QIDQ1724769
Hong-Wei Jiao, Yong-Qiang Chen, Wei-Xin Cheng
Publication date: 14 February 2019
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/698489
Related Items (4)
An efficient algorithm for computing a class of multiplicative optimization problem ⋮ An effective algorithm for globally solving quadratic programs using parametric linearization technique ⋮ Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints ⋮ An effective global optimization algorithm for quadratic programs with quadratic constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving a class of geometric programming problems by an efficient dynamic model
- Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- A review of recent advances in global optimization
- On generalized geometric programming problems with non-positive variables
- A new rectangle branch-and-pruning approach for generalized geometric programming
- A global optimization algorithm using parametric linearization relaxation
- A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints
- Bilinear programming and structured stochastic games
- Handbook of test problems in local and global optimization
- A global optimization algorithm for signomial geometric programming problem
- Linearization method of global optimization for generalized geometric programming
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- A global optimization algorithm for generalized quadratic programming
- A global optimization algorithm using Lagrangian underestimates and the interval Newton method
- A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem
- A relaxation method for nonconvex quadratically constrained quadratic programs
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- Branch-reduction-bound algorithm for generalized geometric programming
- MM algorithms for geometric and signomial programming
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A deterministic global optimization algorithm for generalized geometric programming
- A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems
- Global optimization for generalized geometric programming problems with discrete variables
- Quadratically constrained quadratic programming: Some applications and a method for solution
- A Cutting Plane Approach for Chance Constrained Linear Programs
- Linear Control of a Markov Production System
- Duality bound method for the general quadratic programming problem with quadratic constraints
This page was built for publication: A novel optimization method for nonconvex quadratically constrained quadratic programs
