Pages that link to "Item:Q1810971"

The following pages link to Extension of quasi-Newton methods to mathematical programs with complementarity con\-straints (Q1810971):

Displaying 17 items.

• Feasibility problems with complementarity constraints (Q320869) (← links)
• Bilevel direct search method for leader-follower problems and application in health insurance (Q336826) (← links)
• An inexact Newton method for stationary points of mathematical programs constrained by parameterized quasi-variational inequalities (Q494664) (← links)
• Feasible method for generalized semi-infinite programming (Q604267) (← links)
• Three modeling paradigms in mathematical programming (Q607499) (← links)
• Lifting mathematical programs with complementarity constraints (Q662308) (← links)
• Smoothing methods for nonsmooth, nonconvex minimization (Q715249) (← links)
• Application of general semi-infinite programming to lapidary cutting problems (Q932204) (← links)
• Algorithms for linear programming with linear complementarity constraints (Q1935876) (← links)
• A smoothing Newton method for mathematical programs governed by second-order cone constrained generalized equations (Q1941032) (← links)
• A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints (Q2369090) (← links)
• A general MPCC model and its solution algorithm for continuous network design problem (Q2473113) (← links)
• Merit-function piecewise SQP algorithm for mathematical programs with equilibrium constraints (Q2483036) (← links)
• (Q4503628) (← links)
• Some properties of regularization and penalization schemes for MPECs (Q4657706) (← links)
• On the global minimization of the value-at-risk (Q4657710) (← links)
• On solving difference of convex functions programs with linear complementarity constraints (Q6166653) (← links)