Finite termination of a Newton-type algorithm based on a new class of smoothing functions for the affine variational inequality problem

DOI10.1016/j.amc.2015.08.045zbMath1410.90228OpenAlexW1662996886MaRDI QIDQ670858

Na Zhao

Publication date: 20 March 2019

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

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

zbMATH Keywords

finite terminationsmoothing functionaffine variational inequality problemmaximally complementary solutionsmoothing-type method

Mathematics Subject Classification ID

Variational inequalities (49J40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical methods for variational inequalities and related problems (65K15)

Cites Work

• Unnamed Item
• 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
• The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem
• Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem
• A family of NCP functions and a descent method for the nonlinear complementarity problem
• Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem
• Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems
• Finding an interior point in the optimal face of linear programs
• 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
• A global linear and local quadratic continuation smoothing method for variational inequalities with box constraints
• A modified augmented Lagrangian method for a class of monotone variational inequalities
• 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 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
• 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
• Iterative methods for linear complementarity problems with upperbounds on primary variables
• 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