Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
type: Item
instance of: scholarly article
title: Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
zbMATH Open document ID: 1409.90130
author: Hezhi Luo
author: Xiaodi Bai
author: Jiming Peng
published in: Journal of Optimization Theory and Applications
publication date: 2019-03-06T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 7032731
zbMATH Keywords: quadratic programming
zbMATH Keywords: conditionally quasi-convex relaxation
zbMATH Keywords: iterative search
zbMATH Keywords: bisection search
zbMATH Keywords: penalty method
describes a project that uses: CVX
describes a project that uses: CPLEX
describes a project that uses: SDPT3
MaRDI profile type: Publication
full work available at URL: s10957-018-1416-0
OpenAlex ID: W2897697015
cites work: Quadratic programming with one negative eigenvalue is NP-hard
cites work: Semidefinite Programming
cites work: Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
cites work: Quadratic maximization and semidefinite relaxation
cites work: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
cites work: Branch-and-bound approaches to standard quadratic optimization problems
cites work: A feasible active set method with reoptimization for convex quadratic mixed-integer programming
cites work: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
cites work: A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems
cites work: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
cites work: Q4801579
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Semidefinite relaxation and nonconvex quadratic optimization
cites work: Approximating global quadratic optimization with convex quadratic constraints
cites work: On maximization of quadratic form over intersection of ellipsoids with common center
cites work: Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
cites work: Convex Relaxations of (0, 1)-Quadratic Programming
cites work: Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
cites work: Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
cites work: Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
cites work: Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
cites work: Copositive realxation for genera quadratic programming
cites work: On the copositive representation of binary and continuous nonconvex quadratic programs
cites work: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
cites work: Computable representations for convex hulls of low-dimensional quadratic forms
cites work: Cones of Matrices and Set-Functions and 0–1 Optimization
cites work: Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
cites work: On the gap between the quadratic integer programming problem and its semidefinite relaxation
cites work: On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program
cites work: A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties
cites work: Set-valued analysis
cites work: Q4821526
cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
cites work: The nonlinear knapsack problem - algorithms and applications
cites work: A Selection Problem of Shared Fixed Costs and Network Flows
cites work: Approximating Maximum Clique by Removing Subgraphs
cites work: The quadratic knapsack problem -- a survey
Wikidata QID: Q129055345
DOI: 10.1007/S10957-018-1416-0
description: scientific article; zbMATH DE number 7032731