Pages that link to "Item:Q1396819"
From MaRDI portal
The following pages link to A feasible semismooth asymptotically Newton method for mixed complementarity problems (Q1396819):
Displaying 35 items.
- A modified feasible semi-smooth asymptotically Newton method for nonlinear complementarity problems (Q311331) (← links)
- Smoothing proximal gradient method for general structured sparse regression (Q439167) (← links)
- A modified Hestenes-Stiefel projection method for constrained nonlinear equations and its linear convergence rate (Q499978) (← links)
- A new Levenberg-Marquardt type algorithm for solving nonsmooth constrained equations (Q530014) (← links)
- Feasible smooth method based on Barzilai-Borwein method for stochastic linear complementarity problem (Q542438) (← links)
- Solving equations via the trust region and its application to a class of stochastic linear complementarity problems (Q552359) (← links)
- New reformulation and feasible semismooth Newton method for a class of stochastic linear complementarity problems (Q555370) (← links)
- A new smoothing Newton method for solving constrained nonlinear equations (Q555395) (← links)
- A smoothing Levenberg-Marquardt algorithm for solving a class of stochastic linear complementarity problem (Q620991) (← links)
- Partial projected Newton method for a class of stochastic linear complementarity problems (Q652329) (← links)
- A smoothing Newton method for solving a class of stochastic linear complementarity problems (Q660767) (← links)
- 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)
- Smoothing Newton method for NCP with the identification of degenerate indices (Q989148) (← links)
- A smoothing projected Newton-type algorithm for semi-infinite programming (Q1001204) (← links)
- Feasible semismooth Newton method for a class of stochastic linear complementarity problems (Q1014020) (← links)
- Smoothing nonmonotone Barzilai-Borwein gradient method and its application to stochastic linear complementarity problems (Q1665639) (← links)
- Analysis on Newton projection method for the split feasibility problem (Q2012236) (← links)
- Spectral gradient projection method for monotone nonlinear equations with convex constraints (Q2271390) (← links)
- Convergence analysis of a projection algorithm for variational inequality problems (Q2301198) (← links)
- Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms (Q2316618) (← links)
- A new steepest descent differential inclusion-based method for solving general nonsmooth convex optimization problems (Q2442700) (← links)
- The Lagrangian globalization method for nonsmooth constrained equations (Q2506171) (← links)
- A generalized hybrid CGPM-based algorithm for solving large-scale convex constrained equations with applications to image restoration (Q2656084) (← links)
- A modified inertial three-term conjugate gradient projection method for constrained nonlinear equations with applications in compressed sensing (Q2699991) (← links)
- A smoothing approach for the optimal parameter selection problem with continuous inequality constraint (Q2867401) (← 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)
- Trust-region method for box-constrained semismooth equations and its applications to complementary problems (Q4902845) (← links)
- (Q4998877) (← links)
- Smoothing projected cyclic Barzilai–Borwein method for stochastic linear complementarity problems (Q5739606) (← links)
- A new hybrid CGPM-based algorithm for constrained nonlinear monotone equations with applications (Q6578247) (← links)
- An effective inertial-relaxed CGPM for nonlinear monotone equations (Q6578282) (← links)
- A conjugate gradient projection method with restart procedure for solving constraint equations and image restorations (Q6584774) (← links)
- An IDFPM-based algorithm without Lipschitz continuity to constrained nonlinear equations for sparse signal and blurred image restoration problems (Q6633300) (← links)