A feasible semismooth asymptotically Newton method for mixed complementarity problems
From MaRDI portal
Newton-type methods (49M15) Numerical computation of solutions to systems of equations (65H10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Methods of quasi-Newton type (90C53) Derivative-free methods and methods using generalized derivatives (90C56)
Recommendations
- A strictly feasible Newton method for mixed complementarity problems
- A damped semismooth Newton method for mixed linear complementarity problems
- Feasible semismooth Newton method for a class of stochastic linear complementarity problems
- scientific article; zbMATH DE number 2104604
- A modified feasible semi-smooth asymptotically Newton method for nonlinear complementarity problems
Cited in
(50)- A smoothing projected Newton-type algorithm for semi-infinite programming
- Feasible semismooth Newton method for a class of stochastic linear complementarity problems
- Smoothing nonmonotone Barzilai-Borwein gradient method and its application to stochastic linear complementarity problems
- Feasible descent algorithms for mixed complementarity problems
- Improving the robustness of descent-based methods for semismooth equations using proximal perturbations
- Analysis on Newton projection method for the split feasibility problem
- Spectral gradient projection method for monotone nonlinear equations with convex constraints
- Convergence analysis of a projection algorithm for variational inequality problems
- Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms
- A new steepest descent differential inclusion-based method for solving general nonsmooth convex optimization problems
- The Lagrangian globalization method for nonsmooth constrained equations
- A generalized hybrid CGPM-based algorithm for solving large-scale convex constrained equations with applications to image restoration
- A modified inertial three-term conjugate gradient projection method for constrained nonlinear equations with applications in compressed sensing
- A smoothing approach for the optimal parameter selection problem with continuous inequality constraint
- An active-set projected trust-region algorithm with limited memory BFGS technique for box-constrained nonsmooth equations
- A damped semismooth Newton iterative method for solving mixed linear complementarity problems
- Globally and superlinearly convergent inexact Newton-Krylov algorithms for solving nonsmooth equations
- A damped semismooth Newton method for mixed linear complementarity problems
- A modified feasible semi-smooth asymptotically Newton method for nonlinear complementarity problems
- A strictly feasible Newton method for mixed complementarity problems
- Smoothing proximal gradient method for general structured sparse regression
- scientific article; zbMATH DE number 2104604 (Why is no real title available?)
- A Feasible Semismooth Gauss-Newton Method for Solving a Class of SLCPs
- Trust-region method for box-constrained semismooth equations and its applications to complementary problems
- Global and quadratic convergence of Newton hard-thresholding pursuit
- A modified Hestenes-Stiefel projection method for constrained nonlinear equations and its linear convergence rate
- A new Levenberg-Marquardt type algorithm for solving nonsmooth constrained equations
- A Class of Active-Set Newton Methods for Mixed ComplementarityProblems
- Numerical results for a globalized active-set Newton method for mixed complementarity problems
- Feasible smooth method based on Barzilai-Borwein method for stochastic linear complementarity problem
- Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems
- scientific article; zbMATH DE number 5041529 (Why is no real title available?)
- Solving equations via the trust region and its application to a class of stochastic linear complementarity problems
- New reformulation and feasible semismooth Newton method for a class of stochastic linear complementarity problems
- A new smoothing Newton method for solving constrained nonlinear equations
- Smoothing projected cyclic Barzilai–Borwein method for stochastic linear complementarity problems
- A smoothing Levenberg-Marquardt algorithm for solving a class of stochastic linear complementarity problem
- Partial projected Newton method for a class of stochastic linear complementarity problems
- A new hybrid CGPM-based algorithm for constrained nonlinear monotone equations with applications
- An effective inertial-relaxed CGPM for nonlinear monotone equations
- A conjugate gradient projection method with restart procedure for solving constraint equations and image restorations
- A smoothing Newton method for solving a class of stochastic linear complementarity problems
- An IDFPM-based algorithm without Lipschitz continuity to constrained nonlinear equations for sparse signal and blurred image restoration problems
- Anderson acceleration of derivative-free projection methods for constrained monotone nonlinear equations
- A derivative free projection method for the singularities of vector fields with convex constraints on Hadamard manifolds
- Active-set projected trust-region algorithm for box-constrained nonsmooth equations
- A regularization Newton method for mixed complementarity problems
- Iteration complexity of a two-step inertial modified CGPM to constrained nonlinear equations for sparse signal and image restoration problems
- Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems
- Smoothing Newton method for NCP with the identification of degenerate indices
This page was built for publication: A feasible semismooth asymptotically Newton method for mixed complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1396819)