Pages that link to "Item:Q4721883"
From MaRDI portal
The following pages link to Inexact Newton methods for the nonlinear complementarity problem (Q4721883):
Displaying 50 items.
- On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization (Q489108) (← links)
- Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing (Q540241) (← links)
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs (Q613430) (← links)
- The relaxed inexact projection methods for the split feasibility problem (Q628879) (← links)
- A sharper global error bound for the generalized linear complementarity problem over a polyhedral cone under weaker conditions (Q721216) (← links)
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications (Q811414) (← links)
- A modified damped Newton method for linear complementarity problems (Q857647) (← links)
- Error bounds for the linear complementarity problem with a P-matrix (Q922962) (← links)
- A projection-filter method for solving nonlinear complementarity problems (Q961587) (← links)
- Self-adaptive implicit methods for monotone variant variational inequalities (Q1035501) (← links)
- Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs (Q1103527) (← links)
- Parallel Newton methods for the nonlinear complementarity problem (Q1116901) (← links)
- Iterative linear programming solution of convex programs (Q1120478) (← links)
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming (Q1188288) (← links)
- Global error bounds for monotone affine variational inequality problems (Q1195343) (← links)
- Two-stage parallel iterative methods for the symmetric linear complementarity problem (Q1201951) (← links)
- An inexact NE/SQP method for solving the nonlinear complementarity problem (Q1202586) (← links)
- Elastoplastic analysis of structures with nonlinear hardening: A nonlinear complementarity approach (Q1309901) (← links)
- Error bounds and convergence analysis of feasible descent methods: A general approach (Q1312756) (← links)
- Error bounds and strong upper semicontinuity for monotone affine variational inequalities (Q1312768) (← links)
- Interior point methods for optimal control of discrete time systems (Q1321328) (← links)
- On the solution of a two ball trust region subproblem (Q1332308) (← links)
- A nonsmooth Newton method for variational inequalities. I: Theory (Q1334958) (← links)
- New improved error bounds for the linear complementarity problem (Q1340062) (← links)
- Error bounds for inconsistent linear inequalities and programs (Q1342080) (← links)
- Inexact damped Newton method for nonlinear complementarity problems (Q1349305) (← links)
- A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems (Q1356057) (← links)
- Error bounds in mathematical programming (Q1365060) (← links)
- On variable-step relaxed projection algorithm for variational inequalities (Q1763409) (← links)
- Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs (Q1765864) (← links)
- The linear complementarity problem as a separable bilinear program (Q1804582) (← links)
- A parallel inexact Newton method for stochastic programs with recourse (Q1918424) (← links)
- A projection method for convex constrained monotone nonlinear equations with applications (Q2006525) (← links)
- A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications (Q2048835) (← links)
- On solving double direction methods for convex constrained monotone nonlinear equations with image restoration (Q2052263) (← links)
- Descent three-term DY-type conjugate gradient methods for constrained monotone equations with application (Q2065023) (← links)
- A modified PRP-type conjugate gradient projection algorithm for solving large-scale monotone nonlinear equations with convex constraint (Q2075960) (← links)
- 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 (Q2104056) (← links)
- Modified optimal Perry conjugate gradient method for solving system of monotone equations with applications (Q2106234) (← links)
- A three-term CGPM-based algorithm without Lipschitz continuity for constrained nonlinear monotone equations with applications (Q2120795) (← links)
- An efficient DY-type spectral conjugate gradient method for system of nonlinear monotone equations with application in signal recovery (Q2130839) (← links)
- Derivative-free method based on DFP updating formula for solving convex constrained nonlinear monotone equations and application (Q2130906) (← links)
- A unified derivative-free projection method model for large-scale nonlinear equations with convex constraints (Q2165796) (← links)
- A modified Dai-Kou-type method with applications to signal reconstruction and blurred image restoration (Q2167359) (← links)
- A new conjugate gradient projection method for convex constrained nonlinear equations (Q2205252) (← links)
- Global convergence via descent modified three-term conjugate gradient projection algorithm with applications to signal recovery (Q2211072) (← links)
- A family of modified spectral projection methods for nonlinear monotone equations with convex constraint (Q2214774) (← links)
- A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing (Q2257217) (← links)
- A modified conjugate gradient method for monotone nonlinear equations with convex constraints (Q2273063) (← links)
- Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach (Q2277159) (← links)
