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.045MaRDI QIDQ670858zbMATH OpenOpenAlexFDO

Authors 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

affine variational inequality problemfinite terminationmaximally complementary solutionsmoothing functionsmoothing-type method

Mathematics Subject Classification ID

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

Recommendations

• Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem
• Finite termination of a Newton-type algorithm for a class of affine variational inequality problems
• On the finite convergence of Newton-type methods for \(P_{0}\) affine variational inequalities
• Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem
• A smoothing inexact Newton method for variational inequality problems

Cites work

• A class of smoothing functions for nonlinear and mixed complementarity problems
• A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
• A family of NCP functions and a descent method for the nonlinear complementarity problem
• A global linear and local quadratic continuation smoothing method for variational inequalities with box constraints
• A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P₀LCPs
• A modified augmented Lagrangian method for a class of monotone variational inequalities
• 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
• A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions
• A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution
• A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
• Computational complexity of LCPs associated with positive definite symmetric matrices
• Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem
• Finding an interior point in the optimal face of linear programs
• Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem
• scientific article; zbMATH DE number 5800589 (Why is no real title available?)
• scientific article; zbMATH DE number 192986 (Why is no real title available?)
• scientific article; zbMATH DE number 1559033 (Why is no real title available?)
• scientific article; zbMATH DE number 2146943 (Why is no real title available?)
• Identification of the optimal active set in a noninterior continuation method for LCP
• Iterative methods for linear complementarity problems with upperbounds on primary variables
• On finite termination of an iterative method for linear complementarity problems
• On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities
• 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
• Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems
• Some continuity properties of polyhedral multifunctions
• Sub-quadratic convergence of a smoothing Newton algorithm for the P₀- and monotone LCP
• The global linear convergence of a noninterior path-following algorithm for linear complementarity problems
• The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem

Cited in

(5)

• 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
• Finite termination of a dual Newton method for convex best \(C^1\) interpolation and smoothing
• Finite termination of a Newton-type algorithm for a class of affine variational inequality problems
• Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem

This page was built for publication: Finite termination of a Newton-type algorithm based on a new class of smoothing functions for the affine variational inequality problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q670858)