An accelerated monotonic convergent algorithm for a class of non-Lipschitzian NCP(F) involving an M-matrix
From MaRDI portal
Publication:2033076
Free boundary problems for PDEs (35R35) Numerical computation of solutions to systems of equations (65H10) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Recommendations
- Accelerated non-monotonic explicit proximal-type method for solving equilibrium programming with convex constraints and its applications
- A class of nonmonotone conjugate gradient methods for nonconvex functions
- An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems
- A nonlinear conjugate gradient method for a special class of matrix optimization problems
- Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem
- A new accelerating method for globally solving a class of nonconvex programming problems
- A class of nonmonotone conjugate gradient methods for unconstraint optimization
- On the monotone convergence of matrix multisplitting relaxation methods for the linear complementarity problem
- Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems
- The monotone convergence of a class of parallel nonlinear relaxation methods for nonlinear complementarity problems
Cites work
- \(H\)-splittings and two-stage iterative methods
- A box-constrained differentiable penalty method for nonlinear complementarity problems
- A monotone semismooth Newton type method for a class of complementarity problems
- A new smoothing Broyden-like method for solving nonlinear complementarity problem with a \(P_{0}\)-function
- A regularized projection method for complementarity problems with non-Lipschitzian functions
- A semismooth equation approach to the solution of nonlinear complementarity problems
- A smoothing inexact Newton method for nonlinear complementarity problems
- A smoothing Levenberg-Marquardt method for nonlinear complementarity problems
- A smoothing Newton method for nonlinear complementarity problems
- A smoothing Newton method for the second-order cone complementarity problem.
- A superlinearly convergent method for a class of complementarity problems with non-Lipschitzian functions
- Accelerated modulus-based matrix splitting iteration method for a class of nonlinear complementarity problems
- Diffusion and reaction with monotone kinetics
- Engineering and Economic Applications of Complementarity Problems
- Finite element approximation of a model reaction-diffusion problem with a non-Lipschitz nonlinearity
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Hausdoff measure estimates of a free boundary for a minimum problem
- High order Bellman equations and weakly chained diagonally dominant tensors
- scientific article; zbMATH DE number 3964583 (Why is no real title available?)
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 194971 (Why is no real title available?)
- scientific article; zbMATH DE number 3342967 (Why is no real title available?)
- Power penalty method for a linear complementarity problem arising from American option valuation
- Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs
- Some Convergence Results for Howard's Algorithm
- The Free Boundary of a Semilinear Elliptic Equation
Cited in
(2)
This page was built for publication: An accelerated monotonic convergent algorithm for a class of non-Lipschitzian NCP\((F)\) involving an \(M\)-matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2033076)