Pages that link to "Item:Q3008599"

The following pages link to A globally convergent sequential linear programming algorithm for mathematical programs with linear complementarity constraints (Q3008599):

Displaying 4 items.

• Solving quadratic convex bilevel programming problems using a smoothing method (Q632921) (← links)
• A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints (Q704808) (← links)
• A global \(\mathbb{R}\)-linear convergence algorithm for the generalized linear complementarity problem over a closed convex cone (Q2793081) (← links)
• A primal-dual interior-point method based on a new kernel function for linear complementarity problem (Q5243687) (← links)