Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem

DOI10.1016/j.amc.2008.03.027zbMath1151.65059OpenAlexW1971013713MaRDI QIDQ942413

Na Zhao, Wei Wu

Publication date: 5 September 2008

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2008.03.027

zbMATH Keywords

affine variational inequalitymaximally complementary solutionsmoothing-type method

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Variational inequalities (49J40)

Related Items

A predictor-corrector smoothing Newton method for symmetric cone complementarity problems ⋮ Finite termination of a Newton-type algorithm based on a new class of smoothing functions for the affine variational inequality problem ⋮ A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search ⋮ Convergence of a non-interior smoothing method for variational inequality problems ⋮ Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem

Cites Work

• Unnamed Item
• 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
• Improved smoothing-type methods for the solution of linear programs
• Non-interior continuation methods for solving semidefinite complementarity problems
• Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
• Locating a maximally complementary solution of the monotone NCP by using non-interior-point smoothing algorithms
• A class of smoothing functions for nonlinear and mixed complementarity problems
• Predictor-corrector smoothing methods for linear programs with a more flexible update of the smoothing parameter
• 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 non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
• Convergence properties of a non-interior-point smoothing algorithm for the \(P*\)NCP
• A non-interior continuation algorithm for the \(P_0\) or \(P*\) LCP with strong global and local convergence properties
• The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems
• Computational complexity of LCPs associated with positive definite symmetric matrices
• A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P₀LCPs
• A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions
• A Global and Local Superlinear Continuation-Smoothing Method forP₀andR₀NCP or Monotone NCP
• Iterative methods for linear complementarity problems with upperbounds on primary variables
• Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
• A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
• A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution
• Superlinear noninterior one-step continuation method for monotone LCP in the absence of strict complementarity.