A new algorithm for concave quadratic programming
From MaRDI portal
Publication:2010088
Recommendations
- A branch and bound method mixed with cutting plane technique for solving concave quadratic programming problems
- Duality bound method for the general quadratic programming problem with quadratic constraints
- Global minimization algorithms for concave quadratic programming problems
- Dual bounds and optimality cuts for all-quadratic programs with convex constraints
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
Cites work
- A bounded degree SOS hierarchy for polynomial optimization
- A double look at duality
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A mathematical view of interior-point methods in convex optimization
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- A Survey of the S-Lemma
- An improved algorithm to test copositivity
- An introduction to polynomial and semi-algebraic optimization
- Computationally Related Problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Convex analysis and global optimization
- Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained quadratic optimization problems
- Dual quadratic estimates in polynomial and Boolean programming
- Equivalence in nonlinear programming
- Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers
- Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
- Generating cutting planes for the semidefinite relaxation of quadratic programs
- Global optimization. Theory, algorithms, and applications
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- Handelman's hierarchy for the maximum stable set problem
- scientific article; zbMATH DE number 1534299 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 757677 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- Lagrange duality and partitioning techniques in nonconvex global optimization
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Maximization of A convex quadratic function under linear constraints
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- New bounds for nonconvex quadratically constrained quadratic programming
- On Cones of Nonnegative Quadratic Functions
- On cones of nonnegative quartic forms
- On zero duality gap in nonconvex quadratic programming problems
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Optimization on low rank nonconvex structures
- Quadratic programming with one negative eigenvalue is NP-hard
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Separation and relaxation for cones of quadratic forms
Cited in
(20)- Algorithms for bound constrained quadratic programming problems
- New theoretical results on recursive quadratic programming algorithms
- A new algorithm for solving the general quadratic programming problem
- A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues
- New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming
- A new algorithm for quadratic integer programming problems with cardinality constraint
- Maximization of a PSD quadratic form and factorization
- Robustness of Farrell cost efficiency measurement under data perturbations: evidence from a US manufacturing application
- New bounds for nonconvex quadratically constrained quadratic programming
- An Algorithm for Unconstrained Quadratically Penalized Convex Optimization
- An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations
- scientific article; zbMATH DE number 1382488 (Why is no real title available?)
- On the relation between concavity cuts and the surrogate dual for convex maximization problems
- A branch and bound method mixed with cutting plane technique for solving concave quadratic programming problems
- scientific article; zbMATH DE number 6263278 (Why is no real title available?)
- Dual bounds and optimality cuts for all-quadratic programs with convex constraints
- A generalized robust data envelopment analysis model based on directional distance function
- Globally solving concave quadratic programs via doubly nonnegative relaxation
- A new algorithm for solving convex parametric quadratic programs based on graphical derivatives of solution mappings
- Quadratic maximization of reachable values of stable discrete-time affine systems
This page was built for publication: A new algorithm for concave quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010088)
