Pages that link to "Item:Q1780125"

The following pages link to A smoothing Newton algorithm for mathematical programs with complementarity constraints (Q1780125):

Displaying 11 items.

• Feasibility problems with complementarity constraints (Q320869) (← links)
• Globally convergent algorithm for solving stationary points for mathematical programs with complementarity constraints via nonsmooth reformulations (Q380457) (← links)
• A non-monotone line search algorithm for unconstrained optimization (Q618548) (← links)
• A new smoothing scheme for mathematical programs with complementarity constraints (Q625758) (← links)
• A smoothing Newton method with a mixed line search for monotone weighted complementarity problems (Q782310) (← links)
• A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function (Q1721022) (← links)
• Newton-type method for a class of mathematical programs with complementarity constraints (Q2477225) (← links)
• Hybrid approach with active set identification for mathematical programs with complementarity constraints (Q2499368) (← links)
• Superlinear Convergence of a Smooth Approximation Method for Mathematical Programs with Nonlinear Complementarity Constraints (Q3170064) (← links)
• A constrained non-linear system approach for the solution of an extended limit analysis problem (Q3567305) (← links)
• A new smoothing method for mathematical programs with complementarity constraints (Q4690468) (← links)