Pages that link to "Item:Q2757604"

The following pages link to Regular Pseudo-Smooth NCP and BVIP Functions and Globally and Quadratically Convergent Generalized Newton Methods for Complementarity and Variational Inequality Problems (Q2757604):

Displaying 16 items.

• Active-set projected trust-region algorithm for box-constrained nonsmooth equations (Q704744) (← links)
• Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems (Q732492) (← links)
• A smoothing Broyden-like method for the mixed complementarity problems (Q814293) (← links)
• On almost smooth functions and piecewise smooth functions (Q881610) (← links)
• A new modified one-step smoothing Newton method for solving the general mixed complementarity problem (Q972157) (← links)
• Smoothing Newton method for NCP with the identification of degenerate indices (Q989148) (← links)
• Solving a class of variational inequalities with inexact oracle operators (Q992039) (← links)
• A smoothing Newton method for semi-infinite programming (Q1777435) (← links)
• Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization (Q1938913) (← links)
• A Newton-type algorithm for solving problems of search theory (Q1953229) (← links)
• Boundedness and regularity properties of semismooth reformulations of variational inequalities (Q2501118) (← links)
• An unconstrained smooth minimization reformulation of the second-order cone complementarity problem (Q2576724) (← links)
• A Finsler geometrical programming approach to the nonlinear complementarity problem of traffic equilibrium (Q2696966) (← links)
• An active-set projected trust-region algorithm with limited memory BFGS technique for box-constrained nonsmooth equations (Q2868903) (← links)
• Globally and superlinearly convergent inexact Newton-Krylov algorithms for solving nonsmooth equations (Q3090786) (← links)
• Solving nonlinear complementarity problems with neural networks: A reformulation method approach (Q5939878) (← links)