Inexact Newton methods for the nonlinear complementarity problem
An exact Newton method for solving a nonlinear complementarity problem consists of solving a sequence of linear complementarity subproblems. For problems of large size, solving the subproblems exactly can be very expensive. In this paper we study inexact Newton methods for solving the nonlinear complementarity problem. In such an inexact method, the subproblems are solved only up to a certain degree of accuracy. The necessary accuracies that are needed to preserve the nice features of the exact Newton method are established and analyzed. We also discuss some extensions as well as an application.
- scientific article; zbMATH DE number 4113873
- A smoothing inexact Newton method for nonlinear complementarity problems
- scientific article; zbMATH DE number 4203606
- Inexact semismooth Newton methods for large-scale complementarity problems
- Inexact damped Newton method for nonlinear complementarity problems
- A lagrangean relaxation algorithm for the constrained matrix problem
- Computational Experience in Solving Equilibrium Models by a Sequence of Linear Complementarity Problems
- Computing nonlinear network equilibria
- scientific article; zbMATH DE number 3934327 (Why is no real title available?)
- scientific article; zbMATH DE number 1096546 (Why is no real title available?)
- scientific article; zbMATH DE number 3802748 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Inexact Newton Methods
- Iterative methods for variational and complementarity problems
- Linearized simplicial decomposition methods for computing traffic equilibria on networks
- Monotone Operators and the Proximal Point Algorithm
- More results on the convergence of iterative methods for the symmetric linear complementarity problem
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Quasi-Newton Methods, Motivation and Theory
- Strongly Regular Generalized Equations
- Self-adaptive implicit methods for monotone variant variational inequalities
- Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs
- Parallel Newton methods for the nonlinear complementarity problem
- Iterative linear programming solution of convex programs
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
- Global error bounds for monotone affine variational inequality problems
- Two-stage parallel iterative methods for the symmetric linear complementarity problem
- An inexact NE/SQP method for solving the nonlinear complementarity problem
- Elastoplastic analysis of structures with nonlinear hardening: A nonlinear complementarity approach
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Error bounds and strong upper semicontinuity for monotone affine variational inequalities
- Interior point methods for optimal control of discrete time systems
- Gauss-Newton methods for the complementarity problem
- On the solution of a two ball trust region subproblem
- A nonsmooth Newton method for variational inequalities. I: Theory
- New improved error bounds for the linear complementarity problem
- Error bounds for inconsistent linear inequalities and programs
- Inexact damped Newton method for nonlinear complementarity problems
- A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
- Error bounds in mathematical programming
- Inexact interior-point method
- A block Newton's method for computing invariant pairs of nonlinear matrix pencils
- An inexact Newton method for solving complementarity problems in hydrodynamic lubrication
- On variable-step relaxed projection algorithm for variational inequalities
- Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs
- The linear complementarity problem as a separable bilinear program
- A parallel inexact Newton method for stochastic programs with recourse
- A projection method for convex constrained monotone nonlinear equations with applications
- A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications
- On solving double direction methods for convex constrained monotone nonlinear equations with image restoration
- Descent three-term DY-type conjugate gradient methods for constrained monotone equations with application
- A modified PRP-type conjugate gradient projection algorithm for solving large-scale monotone nonlinear equations with convex constraint
- An efficient conjugate gradient-based algorithm for unconstrained optimization and its projection extension to large-scale constrained nonlinear equations with applications in signal recovery and image denoising problems
- Modified optimal Perry conjugate gradient method for solving system of monotone equations with applications
- A three-term CGPM-based algorithm without Lipschitz continuity for constrained nonlinear monotone equations with applications
- An efficient DY-type spectral conjugate gradient method for system of nonlinear monotone equations with application in signal recovery
- Derivative-free method based on DFP updating formula for solving convex constrained nonlinear monotone equations and application
- A unified derivative-free projection method model for large-scale nonlinear equations with convex constraints
- A modified Dai-Kou-type method with applications to signal reconstruction and blurred image restoration
- Inexact Newton method with feasible inexact projections for solving constrained smooth and nonsmooth equations
- A new conjugate gradient projection method for convex constrained nonlinear equations
- Newton-type methods for non-convex optimization under inexact Hessian information
- Global convergence via descent modified three-term conjugate gradient projection algorithm with applications to signal recovery
- A family of modified spectral projection methods for nonlinear monotone equations with convex constraint
- A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing
- A modified conjugate gradient method for monotone nonlinear equations with convex constraints
- Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
- An adaptive family of projection methods for constrained monotone nonlinear equations with applications
- A new error bound for linear complementarity problems with weakly chained diagonally dominant \(B\)-matrices
- Convergence analysis of a projection algorithm for variational inequality problems
- A class of projection and contraction methods for monotone variational inequalities
- On the Newton-type method with admissible trajectories for mixed complementarity problems
- Inexact multisplitting methods for linear complementarity problems
- Equivalence of the generalized complementarity problem to differentiable unconstrained minimization
- A generalized hybrid CGPM-based algorithm for solving large-scale convex constrained equations with applications to image restoration
- Signal recovery with convex constrained nonlinear monotone equations through conjugate gradient hybrid approach
- A modified inertial three-term conjugate gradient projection method for constrained nonlinear equations with applications in compressed sensing
- Projection and contraction methods for nonlinear complementarity problem
- Inexact Newton methods of mixed nonlinear complementary problems
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- A globally and locally superlinearly convergent inexact Newton-GMRES method for large-scale variational inequality problem
- An almost smooth equation reformulation to the nonlinear complementarity problem and Newton's method
- Inexact Newton Methods with Restricted Additive Schwarz Based Nonlinear Elimination for Problems with High Local Nonlinearity
- scientific article; zbMATH DE number 6001321 (Why is no real title available?)
- scientific article; zbMATH DE number 4203589 (Why is no real title available?)
- scientific article; zbMATH DE number 4203606 (Why is no real title available?)
- scientific article; zbMATH DE number 4215289 (Why is no real title available?)
- A new predicto-corrector method for pseudomonotone nonlinear complementarity problems
- scientific article; zbMATH DE number 3974764 (Why is no real title available?)
- scientific article; zbMATH DE number 4128320 (Why is no real title available?)
- scientific article; zbMATH DE number 1306977 (Why is no real title available?)
- scientific article; zbMATH DE number 706825 (Why is no real title available?)
- A new proximal-based globalization strategy for the Josephy‐Newton method for variational inequalities
- Nonmonotone inexact Newton method for the extended linear complementarity problem
- Inexact semismooth Newton methods for large-scale complementarity problems
- scientific article; zbMATH DE number 4113873 (Why is no real title available?)
- On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization
- scientific article; zbMATH DE number 1424202 (Why is no real title available?)
- Iterative methods for fixed points and zero points of nonlinear mappings with applications
- A Perry-type derivative-free algorithm for solving nonlinear system of equations and minimizing \(\ell_1\) regularized problem
- A spectral conjugate gradient projection algorithm to solve the large-scale system of monotone nonlinear equations with application to compressed sensing
- Improved inexact alternating direction methods for a class of nonlinear complementarity problems
- An inexact Newton algorithm for horizontal complementarity
- Inexact Newton Method for Minimization of Convex Piecewise Quadratic Functions
- A descent Dai-Liao projection method for convex constrained nonlinear monotone equations with applications
- A gradient projection method for the sparse signal reconstruction in compressive sensing
- Non-smooth equations based method for _1-norm problems with applications to compressed sensing
- scientific article; zbMATH DE number 5233132 (Why is no real title available?)
- Error bounds for R₀-type and monotone nonlinear complementarity problems.
- A new accuracy criterion for approximate proximal point algorithms
- Improvements of some projection methods for monotone nonlinear variational inequalities
- Shifted skew-symmetric iteration methods for nonsymmetric linear complementarity problems
- Exact computation of an error bound for the balanced linear complementarity problem with unique solution
- An inertial spectral CG projection method based on the memoryless BFGS update
- New three-term conjugate gradient algorithm for solving monotone nonlinear equations and signal recovery problems
- A family of three-term conjugate gradient projection methods with a restart procedure and their relaxed-inertial extensions for the constrained nonlinear pseudo-monotone equations with applications
- Two families of hybrid conjugate gradient methods with restart procedures and their applications
- Another hybrid approach for solving monotone operator equations and application to signal processing
- A projection-based derivative free DFP approach for solving system of nonlinear convex constrained monotone equations with image restoration applications
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
This page was built for publication: Inexact Newton methods for the nonlinear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4721883)