On convex quadratic programs with linear complementarity constraints
From MaRDI portal
Recommendations
- A class of quadratic programs with linear complementarity constraints
- scientific article; zbMATH DE number 57066
- Conic approximation to quadratic optimization with linear complementarity constraints
- On linear programs with linear complementarity constraints
- On quadratic and complete quadratic problems of convex programming
- On convex relaxations for quadratically constrained quadratic programming
- scientific article; zbMATH DE number 757652
- Linear complementarity procedures in quadratic programming
- Quadratic programming problems and related linear complementarity problems
- Convex quadratic mixed-integer problems with quadratic constraints
Cites work
- An integrated method for planning and scheduling to minimize tardiness
- An LPCC approach to nonconvex quadratic programs
- Eigenvalue techniques for convex objective, nonconvex optimization problems
- Exact matrix completion via convex optimization
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- scientific article; zbMATH DE number 1550909 (Why is no real title available?)
- Logic-based Benders decomposition
- Obtaining tighter relaxations of mathematical programs with complementarity constraints
- On linear programs with linear complementarity constraints
- On Quadratic Programming
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- OPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Three modeling paradigms in mathematical programming
Cited in
(33)- A note on a quadratic formulation for linear complementarity problems
- A note on composite concave quadratic programming
- On quadratic and complete quadratic problems of convex programming
- A branch-and-bound algorithm for instrumental variable quantile regression
- Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming
- Compact linearization for binary quadratic problems subject to assignment constraints
- 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 algorithm for global solution to bi-parametric linear complementarity constrained linear programs
- Conic approximation to quadratic optimization with linear complementarity constraints
- Linear complementarity problems over symmetric cones: characterization of \(Q _{b }\)-transformations and existence results
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
- On alternative optimal solutions to quasimonotonic programming with linear constraints
- A semidefinite programming heuristic for quadratic programming problems with complementarity constraints
- Computing B-stationary points of nonsmooth DC programs
- On conic QPCCs, conic QCQPs and completely positive programs
- Enhanced models and improved solution for competitive biofuel supply chain design under land use constraints
- Logic-based Benders decomposition for large-scale optimization
- A constructive approach to estimating pure characteristics demand models with pricing
- scientific article; zbMATH DE number 3988071 (Why is no real title available?)
- On quasiblock discrete programming problems with supplementary constraints
- MPEC methods for bilevel optimization problems
- Direct pseudo-spectral method for optimal control of obstacle problem-an optimal control problem governed by elliptic variational inequality
- A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
- Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix
- On solving difference of convex functions programs with linear complementarity constraints
- Cardinality minimization, constraints, and regularization: a survey
- Perturbation analysis for KKT point sets of constrained optimization problems
- A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints
- LCQPow: a solver for linear complementarity quadratic programs
- An enhanced logical benders approach for linear programs with complementarity constraints
- A class of quadratic programs with linear complementarity constraints
This page was built for publication: On convex quadratic programs with linear complementarity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2377168)
