Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
From MaRDI portal
Recommendations
- Positive semidefinite penalty method for quadratically constrained quadratic programming
- Penalized semidefinite programming for quadratically-constrained quadratic optimization
- A new convex relaxation for quadratically constrained quadratic programming
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Semidefinite programming relaxation for nonconvex quadratic programs
Cites work
- scientific article; zbMATH DE number 1894380 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A Selection Problem of Shared Fixed Costs and Network Flows
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A feasible active set method with reoptimization for convex quadratic mixed-integer programming
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Approximating Maximum Clique by Removing Subgraphs
- Approximating global quadratic optimization with convex quadratic constraints
- Branch-and-bound approaches to standard quadratic optimization problems
- Computable representations for convex hulls of low-dimensional quadratic forms
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
- Convex Relaxations of (0, 1)-Quadratic Programming
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Copositive realxation for genera quadratic programming
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program
- On maximization of quadratic form over intersection of ellipsoids with common center
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the gap between the quadratic integer programming problem and its semidefinite relaxation
- Quadratic maximization and semidefinite relaxation
- Quadratic programming with one negative eigenvalue is NP-hard
- Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Semidefinite Programming
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Semidefinite relaxation and nonconvex quadratic optimization
- Set-valued analysis
- The nonlinear knapsack problem - algorithms and applications
- The quadratic knapsack problem -- a survey
Cited in
(10)- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
- A criterion space algorithm for solving linear multiplicative programming problems
- Global optimization algorithm for solving linear multiplicative programming problems
- Review of mathematical methodology for electric power optimization problems
- Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties
- A sequential quadratic penalty method for nonlinear semidefinite programming
- An effective global algorithm for worst-case linear optimization under polyhedral uncertainty
- Penalized semidefinite programming for quadratically-constrained quadratic optimization
- An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation
- Positive semidefinite penalty method for quadratically constrained quadratic programming
This page was built for publication: Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1730782)
