Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
From MaRDI portal
Publication:1730782
DOI10.1007/s10957-018-1416-0zbMath1409.90130OpenAlexW2897697015WikidataQ129055345 ScholiaQ129055345MaRDI QIDQ1730782
Xiaodi Bai, Hezhi Luo, Jiming Peng
Publication date: 6 March 2019
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-018-1416-0
quadratic programmingpenalty methoditerative searchbisection searchconditionally quasi-convex relaxation
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items (6)
A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation ⋮ Global optimization algorithm for solving linear multiplicative programming problems ⋮ An effective global algorithm for worst-case linear optimization under polyhedral uncertainty ⋮ Review of mathematical methodology for electric power optimization problems ⋮ An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation ⋮ Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties
- Branch-and-bound approaches to standard quadratic optimization problems
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- The quadratic knapsack problem -- a survey
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Quadratic programming with one negative eigenvalue is NP-hard
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Approximating global quadratic optimization with convex quadratic constraints
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Quadratic maximization and semidefinite relaxation
- The nonlinear knapsack problem - algorithms and applications
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- On maximization of quadratic form over intersection of ellipsoids with common center
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- On the copositive representation of binary and continuous nonconvex quadratic programs
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- On the gap between the quadratic integer programming problem and its semidefinite relaxation
- Computable representations for convex hulls of low-dimensional quadratic forms
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming
- On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Semidefinite relaxation and nonconvex quadratic optimization
- Copositive realxation for genera quadratic programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
- Approximating Maximum Clique by Removing Subgraphs
- Convex Relaxations of (0, 1)-Quadratic Programming
- Semidefinite Programming
- A Selection Problem of Shared Fixed Costs and Network Flows
- Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
- Set-valued analysis
This page was built for publication: Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
