Conic approximation to quadratic optimization with linear complementarity constraints
From MaRDI portal
Publication:2397094
DOI10.1007/s10589-016-9855-8zbMath1396.90058OpenAlexW2410501318WikidataQ57429007 ScholiaQ57429007MaRDI QIDQ2397094
Shu-Cherng Fang, Jing Zhou, Wen-Xun Xing
Publication date: 29 May 2017
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-016-9855-8
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Semi-infinite programming (90C34)
Related Items (7)
An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints ⋮ Conic formulation of QPCCs applied to truly sparse QPs ⋮ Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming ⋮ A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs ⋮ An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem ⋮ A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints ⋮ A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- On conic QPCCs, conic QCQPs and completely positive programs
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- A conic approximation method for the 0-1 quadratic knapsack problem
- Computable representation of the cone of nonnegative quadratic forms over a general second-order cone and its application to completely positive programming
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints
- On the solution of NP-hard linear complementarity problems
- A class of quadratic programs with linear complementarity constraints
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Handbook of test problems in local and global optimization
- On the Slater condition for the SDP relaxations of nonconvex sets
- Algorithms for linear programming with linear complementarity constraints
- Convex reformulation for binary quadratic programming problems via average objective value maximization
- A gentle, geometric introduction to copositive optimization
- On convex quadratic programs with linear complementarity constraints
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Lectures on Modern Convex Optimization
- A New Regularization Method for Mathematical Programs with Complementarity Constraints with Strong Convergence Properties
- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
- Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- Some NP-complete problems in quadratic and nonlinear programming
- Engineering and Economic Applications of Complementarity Problems
- Adaptive computable approximation to cones of nonnegative quadratic functions
- Interior Methods for Mathematical Programs with Complementarity Constraints
- On Cones of Nonnegative Quadratic Functions
This page was built for publication: Conic approximation to quadratic optimization with linear complementarity constraints
