A relaxation method for nonconvex quadratically constrained quadratic programs
From MaRDI portal
Recommendations
- A global optimization algorithm using linear relaxation
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
- A simplicial branch-and-bound method for solving nonconvex all-quadratic programs
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
Cites work
- scientific article; zbMATH DE number 30953 (Why is no real title available?)
- scientific article; zbMATH DE number 41029 (Why is no real title available?)
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- A Decomposition Strategy for Global Optimum Search in the Pooling Problem
- A bilinear approach to the pooling problem†
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- An algorithm for indefinite integer quadratic programming
- Bilinear programming and structured stochastic games
- Constrained global optimization: algorithms and applications
- Dual quadratic estimates in polynomial and Boolean programming
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- Global optimization of a quadratic function subject to a bounded mixed integer constraint set
- Jointly Constrained Biconvex Programming
- Jointly constrained bilinear programs and related problems: An overview
- Methods of Nonlinear 0-1 Programming
- Modular Design—A Special Case in Nonlinear Programming
- New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
- Primal-relaxed dual global optimization approach
- Programming with a Quadratic Constraint
- Quadratic programming with quadratic constraints
- Quadratically constrained quadratic programming: Some applications and a method for solution
- Reduction of indefinite quadratic programs to bilinear programs
Cited in
(48)- Duality bound method for the general quadratic programming problem with quadratic constraints
- An accelerating algorithm for globally solving nonconvex quadratic programming
- An iterative rank penalty method for nonconvex quadratically constrained quadratic programs
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
- A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
- The bounds of feasible space on constrained nonconvex quadratic programming
- Lagrangian decomposition of block-separable mixed-integer all-quadratic programs
- A distributed continuous-time method for non-convex QCQPs
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective
- Optimal trade-off portfolio selection between total risk and maximum relative marginal risk†
- A global optimization algorithm using linear relaxation
- Portfolio selection with the effect of systematic risk diversification: formulation and accelerated gradient algorithm
- A global supply chain model with transfer pricing and transportation cost allocation
- An optimal trade-off model for portfolio selection with sensitivity of parameters
- Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint
- Multi-period price promotions in a single-supplier, multi-retailer supply chain under asymmetric demand information
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems
- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs
- Active allocation of systematic risk and control of risk sensitivity in portfolio optimization
- Relaxation and bounding algorithm based on binary mean inequality for quadratically constrained quadratic programming problems
- The exact solution of multiparametric quadratically constrained quadratic programming problems
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- Utility function programs and optimization over the efficient set in multiple-objective decision making
- Application of the combined relaxation method to find equilibrium points of quasi-concave-convex functions
- The relaxation method for certain type of pseudoconvex programming problems
- Relaxation of a quadratic functional defined by a nonnegative unbounded matrix
- An LPCC approach to nonconvex quadratic programs
- Computational methods for solving nonconvex block-separable constrained quadratic problems
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension
- A robust algorithm for quadratic optimization under quadratic constraints
- A novel optimization method for nonconvex quadratically constrained quadratic programs
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- Difference of convex solution of quadratically constrained optimization problems.
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
- A note on weakly active constraints in connection with nonconvex quadratic programming
- On convex relaxations for quadratically constrained quadratic programming
- Semidefinite programming relaxation for nonconvex quadratic programs
- Inventory and investment in setup and quality operations under return on investment maximization
- On solving nonconvex optimization problems by reducing the duality gap
- Packing equal circles in a square: A deterministic global optimization approach
- Global optimization algorithm for mixed integer quadratically constrained quadratic program
- A class of differential quadratic programming problems
This page was built for publication: A relaxation method for nonconvex quadratically constrained quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892602)
