Pages that link to "Item:Q697548"

The following pages link to A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints (Q697548):

Displaying 8 items.

• Optimization problems with equilibrium constraints and their numerical solution. (Q703216) (← links)
• Globalizing a nonsmooth Newton method via nonmonotone path search (Q953292) (← links)
• A branch-and-bound algorithm for instrumental variable quantile regression (Q1697970) (← links)
• A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints (Q2329678) (← links)
• Conic approximation to quadratic optimization with linear complementarity constraints (Q2397094) (← links)
• Nonlinear robust optimization via sequential convex bilevel programming (Q2434994) (← links)
• Direct pseudo-spectral method for optimal control of obstacle problem - an optimal control problem governed by elliptic variational inequality (Q5348436) (← links)
• On solving difference of convex functions programs with linear complementarity constraints (Q6166653) (← links)