Pages that link to "Item:Q1905937"

The following pages link to A Newton-type method for positive-semidefinite linear complementarity problems (Q1905937):

Displaying 19 items.

• Discretization of semilinear bang-singular-bang control problems (Q276875) (← links)
• A smoothing Broyden-like method with a nonmonotone derivative-free line search for nonlinear complementarity problems (Q492135) (← links)
• A modified damped Newton method for linear complementarity problems (Q857647) (← links)
• New constrained optimization reformulation of complementarity problems (Q1264991) (← links)
• Solution of monotone complementarity problems with locally Lipschitzian functions (Q1356058) (← links)
• A new approach to continuation methods for complementarity problems with uniform \(P\)-functions (Q1376327) (← links)
• An SQP method for general nonlinear complementarity problems (Q1595262) (← links)
• A united method for sensitivity analysis of the locational marginal price based on the optimal power flow (Q1717738) (← links)
• Linear complementarity problems on extended second order cones (Q1743527) (← links)
• On finite termination of an iterative method for linear complementarity problems (Q1814795) (← links)
• On the resolution of monotone complementarity problems (Q1815077) (← links)
• A globally convergent filter-type trust region method for semidefinite programming (Q1955230) (← links)
• Pricing American drawdown options under Markov models (Q2030371) (← links)
• A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints (Q2369090) (← links)
• Growth behavior of a class of merit functions for the nonlinear complementarity problem (Q2564173) (← links)
• Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects (Q2802530) (← links)
• Nondegenerate Piecewise Linear Systems: A Finite Newton Algorithm and Applications in Machine Learning (Q2919402) (← links)
• The quasiparticle lifetime in a doped graphene sheet (Q2962385) (← links)
• A sequential ADMM algorithm to find sparse LCP solutions using a \(l_2-l_1\) regularization technique with application in bimatrix game (Q6049293) (← links)