Pages that link to "Item:Q2377168"
From MaRDI portal
The following pages link to On convex quadratic programs with linear complementarity constraints (Q2377168):
Displaying 31 items.
- On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
- Enhanced models and improved solution for competitive biofuel supply chain design under land use constraints (Q320925) (← links)
- A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints (Q697548) (← links)
- An enhanced logical benders approach for linear programs with complementarity constraints (Q785626) (← links)
- A class of quadratic programs with linear complementarity constraints (Q833022) (← links)
- A note on a quadratic formulation for linear complementarity problems (Q1090251) (← links)
- A note on composite concave quadratic programming (Q1306393) (← links)
- On quadratic and complete quadratic problems of convex programming (Q1589846) (← links)
- A branch-and-bound algorithm for instrumental variable quantile regression (Q1697970) (← links)
- Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming (Q1716972) (← links)
- Compact linearization for binary quadratic problems subject to assignment constraints (Q1728408) (← links)
- A study of the difference-of-convex approach for solving linear programs with complementarity constraints (Q1749452) (← links)
- Solving linear programs with complementarity constraints using branch-and-cut (Q2281449) (← links)
- A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints (Q2329678) (← links)
- An algorithm for global solution to bi-parametric linear complementarity constrained linear programs (Q2349521) (← links)
- Conic approximation to quadratic optimization with linear complementarity constraints (Q2397094) (← links)
- Linear complementarity problems over symmetric cones: characterization of \(Q _{b }\)-transformations and existence results (Q2442698) (← links)
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints (Q2448160) (← links)
- On alternative optimal solutions to quasimonotonic programming with linear constraints (Q2465013) (← links)
- A semidefinite programming heuristic for quadratic programming problems with complementarity constraints (Q2487469) (← links)
- Computing B-Stationary Points of Nonsmooth DC Programs (Q2976143) (← links)
- Logic-Based Benders Decomposition for Large-Scale Optimization (Q3296379) (← links)
- A Constructive Approach to Estimating Pure Characteristics Demand Models with Pricing (Q3450466) (← links)
- (Q3752154) (← links)
- On quasiblock discrete programming problems with supplementary constraints (Q3801341) (← links)
- MPEC Methods for Bilevel Optimization Problems (Q5014634) (← links)
- Direct pseudo-spectral method for optimal control of obstacle problem - an optimal control problem governed by elliptic variational inequality (Q5348436) (← links)
- A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming (Q5408222) (← links)
- Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix (Q6120849) (← links)
- On solving difference of convex functions programs with linear complementarity constraints (Q6166653) (← links)
- Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)
