Finite termination of a Newton-type algorithm for a class of affine variational inequality problems
DOI10.1016/J.AMC.2010.08.069zbMATH Open1211.65086OpenAlexW2016555010MaRDI QIDQ613275FDOQ613275
Authors: Na Zhao, Zhenghai Huang
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
Recommendations
- Finite termination of a Newton-type algorithm based on a new class of smoothing functions for the affine variational inequality problem
- On the finite convergence of Newton-type methods for \(P_{0}\) affine variational inequalities
- Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem
- scientific article; zbMATH DE number 1559033
- Finite convergence of nonsmooth equation based methods for affine variational inequalities
- On finite termination of the generalized Newton method for solving absolute value equations
- scientific article; zbMATH DE number 1186891
- Finite termination and global monotonicity of Newton-type methods for solving hybrid piecewise linear systems
- Finite convergence of algorithms for nonlinear programs and variational inequalities
- A Newton-like method for nonsmooth variational inequalities
numerical resultsalgorithmsmoothing Newton methodgeneralized Newton methodfinite terminationaffine variational inequality problem
Variational inequalities (49J40) Numerical methods for variational inequalities and related problems (65K15)
Cites Work
- Title not available (Why is that?)
- A nonsmooth version of Newton's method
- Finding an interior point in the optimal face of linear programs
- A relaxed projection method for variational inequalities
- Computational complexity of LCPs associated with positive definite symmetric matrices
- 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 new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- Smoothing algorithms for complementarity problems over symmetric cones
- Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
- A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution
- A strongly polynomial rounding procedure yielding a maximally complementary solution for \(P_*(\kappa)\) linear complementarity problems
- 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
- A global linear and local quadratic continuation smoothing method for variational inequalities with box constraints
- On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities
- Identification of the optimal active set in a noninterior continuation method for LCP
- A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
- A dual neural network for convex quadratic programming subject to linear equality and inequality constraints
- A neural network for monotone variational inequalities with linear constraints
- 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
- On finite termination of an iterative method for linear complementarity problems
- Sufficient conditions on nonemptiness and boundedness of the solution set of the \(P_{0}\) function nonlinear complementarity problem
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- A Hybrid Newton Method for Stochastic Variational Inequality Problems and Application to Traffic Equilibrium
- Finite termination of a dual Newton method for convex best \(C^1\) interpolation and smoothing
- Title not available (Why is that?)
- On finite termination of the generalized Newton method for solving absolute value equations
- Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem
- Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem
- On the finite convergence of Newton-type methods for \(P_{0}\) affine variational inequalities
This page was built for publication: Finite termination of a Newton-type algorithm for a class of affine variational inequality problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613275)