On convex quadratic programs with linear complementarity constraints

DOI10.1007/s10589-012-9497-4zbMath1295.90035OpenAlexW2051515327MaRDI QIDQ2377168

Lijie Bai, Jong-Shi Pang, John E. Mitchell

Publication date: 28 June 2013

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-012-9497-4

zbMATH Keywords

semidefinite programmingconvex quadratic programminglogical Benders decompositionsatisfiability constraints

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (17)

A Constructive Approach to Estimating Pure Characteristics Demand Models with Pricing ⋮ On conic QPCCs, conic QCQPs and completely positive programs ⋮ Enhanced models and improved solution for competitive biofuel supply chain design under land use constraints ⋮ Conic approximation to quadratic optimization with linear complementarity constraints ⋮ Direct pseudo-spectral method for optimal control of obstacle problem - an optimal control problem governed by elliptic variational inequality ⋮ Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix ⋮ A branch-and-bound algorithm for instrumental variable quantile regression ⋮ Computing B-Stationary Points of Nonsmooth DC Programs ⋮ Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming ⋮ Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints ⋮ Logic-Based Benders Decomposition for Large-Scale Optimization ⋮ A study of the difference-of-convex approach for solving linear programs with complementarity constraints ⋮ Solving linear programs with complementarity constraints using branch-and-cut ⋮ A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints ⋮ An enhanced logical benders approach for linear programs with complementarity constraints ⋮ MPEC Methods for Bilevel Optimization Problems ⋮ An algorithm for global solution to bi-parametric linear complementarity constrained linear programs

Uses Software

• Matlab
• SDPT3
• OPECgen

Cites Work

• Unnamed Item
• An LPCC approach to nonconvex quadratic programs
• On linear programs with linear complementarity constraints
• Three modeling paradigms in mathematical programming
• An integrated method for planning and scheduling to minimize tardiness
• OPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints
• Logic-based Benders decomposition
• Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
• Exact matrix completion via convex optimization
• Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints
• Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems
• On the Global Solution of Linear Programs with Linear Complementarity Constraints
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• On Quadratic Programming

This page was built for publication: On convex quadratic programs with linear complementarity constraints