Finite termination of a Newton-type algorithm for a class of affine variational inequality problems
From MaRDI portal
Publication:613275
DOI10.1016/j.amc.2010.08.069zbMath1211.65086OpenAlexW2016555010MaRDI QIDQ613275
Publication date: 20 December 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2010.08.069
algorithmnumerical resultsgeneralized Newton methodfinite terminationsmoothing Newton methodaffine variational inequality problem
Variational inequalities (49J40) Numerical methods for variational inequalities and related problems (65K15)
Related Items
Unnamed Item, A Hybrid Newton Method for Stochastic Variational Inequality Problems and Application to Traffic Equilibrium
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the finite convergence of interior-point algorithms for linear programming
- On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems
- A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
- Smoothing algorithms for complementarity problems over symmetric cones
- A new one-step smoothing Newton method for nonlinear complementarity problem with \(P_{0}\)-function
- A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search
- Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem
- One-step smoothing Newton method for solving the mixed complementarity problem with a \(P_{0}\) function
- Finding an interior point in the optimal face of linear programs
- Identification of the optimal active set in a noninterior continuation method for LCP
- A dual neural network for convex quadratic programming subject to linear equality and inequality constraints
- On finite termination of an iterative method for linear complementarity problems
- A global linear and local quadratic continuation smoothing method for variational inequalities with box constraints
- A neural network for monotone variational inequalities with linear constraints
- Sufficient conditions on nonemptiness and boundedness of the solution set of the \(P_{0}\) function nonlinear complementarity problem
- Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A nonsmooth version of Newton's method
- A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems
- A relaxed projection method for variational inequalities
- Computational complexity of LCPs associated with positive definite symmetric matrices
- On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities
- A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution
