Pages that link to "Item:Q4702248"

The following pages link to A Smoothing Newton Method for Extended Vertical Linear Complementarity Problems (Q4702248):

Displaying 32 items.

• A sample average approximation regularization method for a stochastic mathematical program with general vertical complementarity constraints (Q484867) (← links)
• On the ERM formulation and a stochastic approximation algorithm of the stochastic-\(R_0\) EVLCP (Q490183) (← links)
• Global error bounds for the extended vertical LCP (Q632384) (← links)
• A network of options: evaluating complex interdependent decisions under uncertainty (Q633325) (← links)
• Smoothing methods for nonsmooth, nonconvex minimization (Q715249) (← links)
• New multiplier method for solving linear complementarity problems (Q719949) (← links)
• On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems (Q811890) (← links)
• A generalized complementarity approach to solving real option problems (Q844678) (← links)
• Global convergence of a smooth approximation method for mathematical programs with complementarity constraints (Q857941) (← links)
• On almost smooth functions and piecewise smooth functions (Q881610) (← links)
• A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search (Q979319) (← links)
• Quadratic one-step smoothing Newton method for \(P_{0}\)-LCP without strict complementarity. (Q1406258) (← links)
• A SAA nonlinear regularization method for a stochastic extended vertical linear complementarity problem (Q1646189) (← links)
• Smooth convex approximation to the maximum eigenvalue function (Q1777442) (← links)
• Global linear and quadratic one-step smoothing Newton method for vertical linear complementarity problems (Q1888919) (← links)
• A smoothing SAA method for a stochastic mathematical program with complementarity constraints. (Q1928176) (← links)
• A block principal pivoting algorithm for vertical generalized LCP with a vertical block P-matrix (Q2059678) (← links)
• Projected splitting methods for vertical linear complementarity problems (Q2139273) (← links)
• A modulus-based formulation for the vertical linear complementarity problem (Q2159423) (← links)
• A new kind of modulus-based matrix splitting methods for vertical linear complementarity problems (Q2171161) (← links)
• A power penalty method for discrete HJB equations (Q2192989) (← links)
• A partially smoothing Jacobian method for nonlinear complementarity problems with \(P_0\) function (Q2345686) (← links)
• The inexact log-exponential regularization method for mathematical programs with vertical complementarity constraints (Q2423272) (← links)
• Un algoritmo Newton inexacto para complementariedad horizontal (Q5089758) (← links)
• A primal-dual algorithm for minimizing a sum of Euclidean norms (Q5957946) (← links)
• A modulus-based matrix splitting method for the vertical nonlinear complementarity problem (Q6046867) (← links)
• Relaxation modulus-based matrix splitting iteration method for vertical linear complementarity problem (Q6073134) (← links)
• Convergence analysis of projected SOR iteration method for a class of vertical linear complementarity problems (Q6103383) (← links)
• Generalized multilinear games and vertical tensor complementarity problems (Q6150642) (← links)
• Existence of the least element solution of the vertical block \(Z\)-tensor complementarity problem (Q6164965) (← links)
• Generalized modulus-based matrix splitting algorithm with Anderson acceleration strategy for vertical linear complementarity problems (Q6489273) (← links)
• Global Error Bounds for the Extended Vertical Linear Complementarity Problems of CKV-Type Matrices and CKV-Type $B$-Matrices (Q6492269) (← links)