Inexact Newton methods for the nonlinear complementarity problem
From MaRDI portal
Publication:4721883
DOI10.1007/BF02591989zbMath0613.90097OpenAlexW2019015034MaRDI QIDQ4721883
Publication date: 1986
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02591989
nonlinear complementarityerror measureexact Newton methodsequence of linear complementarity subproblems
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A three-term CGPM-based algorithm without Lipschitz continuity for constrained nonlinear monotone equations with applications, On the solution of a two ball trust region subproblem, A class of projection and contraction methods for monotone variational inequalities, A nonsmooth Newton method for variational inequalities. I: Theory, 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 spectral conjugate gradient projection algorithm to solve the large-scale system of monotone nonlinear equations with application to compressed sensing, New improved error bounds for the linear complementarity problem, On the Newton-type method with admissible trajectories for mixed complementarity problems, Error bounds for inconsistent linear inequalities and programs, An almost smooth equation reformulation to the nonlinear complementarity problem and Newton's method, Inexact multisplitting methods for linear complementarity problems, Inexact damped Newton method for nonlinear complementarity problems, A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems, Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs, A modified damped Newton method for linear complementarity problems, Error bounds in mathematical programming, A unified derivative-free projection method model for large-scale nonlinear equations with convex constraints, A generalized hybrid CGPM-based algorithm for solving large-scale convex constrained equations with applications to image restoration, Parallel Newton methods for the nonlinear complementarity problem, A modified Dai-Kou-type method with applications to signal reconstruction and blurred image restoration, Iterative linear programming solution of convex programs, A parallel inexact Newton method for stochastic programs with recourse, Signal recovery with convex constrained nonlinear monotone equations through conjugate gradient hybrid approach, Un algoritmo Newton inexacto para complementariedad horizontal, A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs, 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, Modified Dai-Zuan iterative scheme for nonlinear systems and its application, On a scaled symmetric Dai-Liao-type scheme for constrained system of nonlinear equations with applications, The relaxed inexact projection methods for the split feasibility problem, A new predicto-corrector method for pseudomonotone nonlinear complementarity problems, A new conjugate gradient projection method for convex constrained nonlinear equations, A modified inertial three-term conjugate gradient projection method for constrained nonlinear equations with applications in compressed sensing, Global convergence via descent modified three-term conjugate gradient projection algorithm with applications to signal recovery, A gradient projection method for the sparse signal reconstruction in compressive sensing, A family of modified spectral projection methods for nonlinear monotone equations with convex constraint, Error bounds for the linear complementarity problem with a P-matrix, Projection and contraction methods for nonlinear complementarity problem, On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization, 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, A projection-filter method for solving nonlinear complementarity problems, Error bounds for \(R_0\)-type and monotone nonlinear complementarity problems., A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing, Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing, On variable-step relaxed projection algorithm for variational inequalities, A projection method for convex constrained monotone nonlinear equations with applications, Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs, A new proximal-based globalization strategy for the Josephy‐Newton method for variational inequalities, A modified conjugate gradient method for monotone nonlinear equations with convex constraints, A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*, Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach, A sharper global error bound for the generalized linear complementarity problem over a polyhedral cone under weaker conditions, A new accuracy criterion for approximate proximal point algorithms, An adaptive family of projection methods for constrained monotone nonlinear equations with applications, Improvements of some projection methods for monotone nonlinear variational inequalities, A new error bound for linear complementarity problems with weakly chained diagonally dominant \(B\)-matrices, Shifted skew-symmetric iteration methods for nonsymmetric linear complementarity problems, The linear complementarity problem as a separable bilinear program, A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications, Convergence analysis of a projection algorithm for variational inequality problems, On solving double direction methods for convex constrained monotone nonlinear equations with image restoration, Unnamed Item, Descent three-term DY-type conjugate gradient methods for constrained monotone equations with application, Iterative methods for fixed points and zero points of nonlinear mappings with applications, Self-adaptive implicit methods for monotone variant variational inequalities, A modified PRP-type conjugate gradient projection algorithm for solving large-scale monotone nonlinear equations with convex constraint, Equivalence of the generalized complementarity problem to differentiable unconstrained minimization, A Perry-type derivative-free algorithm for solving nonlinear system of equations and minimizing ℓ1regularized problem, Elastoplastic analysis of structures with nonlinear hardening: A nonlinear complementarity approach, 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, Error bounds and convergence analysis of feasible descent methods: A general approach, Error bounds and strong upper semicontinuity for monotone affine variational inequalities, Modified optimal Perry conjugate gradient method for solving system of monotone equations with applications, Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications, A globally and locally superlinearly convergent inexact Newton-GMRES method for large-scale variational inequality problem, Interior point methods for optimal control of discrete time systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- More results on the convergence of iterative methods for the symmetric linear complementarity problem
- Linearized simplicial decomposition methods for computing traffic equilibria on networks
- Computing nonlinear network equilibria
- Computational Experience in Solving Equilibrium Models by a Sequence of Linear Complementarity Problems
- A lagrangean relaxation algorithm for the constrained matrix problem
- Strongly Regular Generalized Equations
- Inexact Newton Methods
- Iterative methods for variational and complementarity problems
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Quasi-Newton Methods, Motivation and Theory
- Monotone Operators and the Proximal Point Algorithm
