Pages that link to "Item:Q3009774"
From MaRDI portal
The following pages link to Convexification Techniques for Linear Complementarity Constraints (Q3009774):
Displaying 15 items.
- Branch-and-cut for complementarity-constrained optimization (Q482112) (← links)
- How to convexify the intersection of a second order cone and a nonconvex quadratic (Q517311) (← links)
- Convexification techniques for linear complementarity constraints (Q2045009) (← links)
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem (Q2176277) (← links)
- A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation (Q2274853) (← links)
- Linearly constrained positive definite completions (Q2277549) (← links)
- Convex integration with linear constraints and its applications (Q2308378) (← links)
- New SOCP relaxation and branching rule for bipartite bilinear programs (Q2331354) (← links)
- A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints (Q2459386) (← links)
- On minimal valid inequalities for mixed integer conic programs (Q2806815) (← links)
- Solving the linear complementarity problem through concave programming (Q3346107) (← links)
- Techniques of linear programming based on the theory of convex cones (Q4733657) (← links)
- The Convex Hull of a Quadratic Constraint over a Polytope (Q5131962) (← links)
- Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction (Q5348475) (← links)
- On solving difference of convex functions programs with linear complementarity constraints (Q6166653) (← links)
