Pages that link to "Item:Q3454970"

The following pages link to Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints (Q3454970):

Displaying 9 items.

• A computational study for bilevel quadratic programs using semidefinite relaxations (Q323274) (← links)
• Branch-and-cut for complementarity-constrained optimization (Q482112) (← links)
• Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach (Q1616936) (← links)
• A branch-and-bound algorithm for instrumental variable quantile regression (Q1697970) (← 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)
• On convex quadratic programs with linear complementarity constraints (Q2377168) (← links)
• Conic approximation to quadratic optimization with linear complementarity constraints (Q2397094) (← links)
• Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints (Q2448160) (← links)