Pages that link to "Item:Q3124044"
From MaRDI portal
The following pages link to A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm (Q3124044):
Displaying 18 items.
- A Sequential Smooth Penalization Approach to Mathematical Programs with Complementarity Constraints (Q5290836) (← links)
- ON SOME NCP-FUNCTIONS BASED ON THE GENERALIZED FISCHER–BURMEISTER FUNCTION (Q5295441) (← links)
- Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems (Q5437523) (← links)
- (Q5490756) (← links)
- An adaptive multi-step Levenberg-Marquardt method for nonlinear complementarity problem (Q5868465) (← links)
- On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods (Q5880389) (← links)
- A smoothing inexact Newton method for nonlinear complementarity problems (Q5897168) (← links)
- A smoothing Gauss-Newton method for the generalized HLCP (Q5936078) (← links)
- Solving nonlinear complementarity problems with neural networks: A reformulation method approach (Q5939878) (← links)
- Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming (Q5942348) (← links)
- Solution point characterizations and convergence analysis of a descent algorithm for nonsmooth continuous complementarity problems. (Q5958086) (← links)
- Hybrid Newton-type method for a class of semismooth equations (Q5959915) (← links)
- A smoothing Newton method based on the modulus equation for a class of weakly nonlinear complementarity problems (Q6166658) (← links)
- A nonsmooth Newton method for solving the generalized complementarity problem (Q6181145) (← links)
- Adaptive space-time domain decomposition for multiphase flow in porous media with bound constraints (Q6543102) (← links)
- Linear and nonlinear solvers for variational phase-field models of brittle fracture (Q6565208) (← links)
- Nonlinearly preconditioned semismooth Newton algorithms for nonlinear nonsmooth systems (Q6590578) (← links)
- CVaR stochastic programming model for monotone stochastic tensor complementarity problem by using its penalized sample average approximation algorithm (Q6664936) (← links)
