Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming
type: Item
instance of: scholarly article
title: Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming
zbMATH Open document ID: 1412.90151
author: Ye Tian
author: Cheng Lu
author: Wenxun Xing
author: Zhibin Deng
published in: Journal of Industrial and Management Optimization
publication date: 2019-02-05T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 49M37
zbMATH DE Number: 7012494
zbMATH Keywords: quadratic programs with complementarity constraints
zbMATH Keywords: augmented Lagrangian method
zbMATH Keywords: branch and bound
zbMATH Keywords: doubly nonnegative relaxation
zbMATH Keywords: semidefinite programming
describes a project that uses: MacMPEC
describes a project that uses: OR-Library
describes a project that uses: OPECgen
MaRDI profile type: Publication
full work available at URL: jimo.2017064
OpenAlex ID: W2658328683
cites work: On convex quadratic programs with linear complementarity constraints
cites work: Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
cites work: On the copositive representation of binary and continuous nonconvex quadratic programs
cites work: Optimizing a polyhedral-semidefinite relaxation of completely positive programs
cites work: Proximal point algorithm for nonlinear complementarity problem based on the generalized Fischer-Burmeister merit function
cites work: On the computational complexity of membership problems for the completely positive cone and its dual
cites work: Engineering and Economic Applications of Complementarity Problems
cites work: A trust-region filter-SQP method for mathematical programs with linear complementarity constraints
cites work: Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
cites work: On the Global Solution of Linear Programs with Linear Complementarity Constraints
cites work: Convergence of optimal values of quadratic penalty problems for mathematical programs with complementarity constraints
cites work: OPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints
cites work: The Linear-Quadratic Bilevel Programming Problem
cites work: A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
cites work: Convex reformulation for binary quadratic programming problems via average objective value maximization
cites work: The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
cites work: Complexity of uniqueness and local search in quadratic 0-1 programming
cites work: Convex Analysis
cites work: A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
cites work: Alternating direction augmented Lagrangian methods for semidefinite programming
cites work: A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
cites work: Conic approximation to quadratic optimization with linear complementarity constraints
DOI: 10.3934/JIMO.2017064
description: scientific article; zbMATH DE number 7012494