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

DOI10.1016/j.amc.2009.01.054zbMath1162.65364OpenAlexW1992296728MaRDI QIDQ1021504

Na Zhao, Ping Wang

Publication date: 8 June 2009

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

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

zbMATH Keywords

finite terminationaffine variational inequality problemmaximally complementary solutionsmoothing-type method

Mathematics Subject Classification ID

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

Related Items

Finite termination of a Newton-type algorithm for a class of affine variational inequality 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, A globally and locally superlinearly convergent inexact Newton-GMRES method for large-scale variational inequality problem

Cites Work

• 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
• Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem
• Finding an interior point in the optimal face of linear programs
• 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
• Identification of the optimal active set in a noninterior continuation method for LCP
• On finite termination of an iterative method for linear complementarity problems
• A class of smoothing functions for nonlinear and mixed complementarity problems
• 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
• A non-interior continuation algorithm for the \(P_0\) or \(P*\) LCP with strong global and local convergence properties
• A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems
• The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems
• Some continuity properties of polyhedral multifunctions
• On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities
• 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
• Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
• A Global and Local Superlinear Continuation-Smoothing Method forP₀andR₀NCP or Monotone NCP
• 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
• The global linear and local quadratic convergence of a non-interior continuation algorithm for the LCP