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

scientific article; zbMATH DE number 5321674

Language	Label	Description	Also known as
English	Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem	scientific article; zbMATH DE number 5321674

Statements

instance of

scholarly article

0 references

title

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

0 references

0 references

0 references

Applied Mathematics and Computation

0 references

publication date

5 September 2008

0 references

zbMATH Keywords

affine variational inequality

0 references

smoothing-type method

0 references

maximally complementary solution

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1016/j.amc.2008.03.027

0 references

cites work

Iterative methods for linear complementarity problems with upperbounds on primary variables

0 references

The global linear convergence of a noninterior path-following algorithm for linear complementarity problems

0 references

A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem

0 references

A Global and Local Superlinear Continuation-Smoothing Method forP0andR0NCP or Monotone NCP

0 references

Superlinear noninterior one-step continuation method for monotone LCP in the absence of strict complementarity.

0 references

A class of smoothing functions for nonlinear and mixed complementarity problems

0 references

Non-interior continuation methods for solving semidefinite complementarity problems

0 references

Improved smoothing-type methods for the solution of linear programs

0 references

Predictor-corrector smoothing methods for linear programs with a more flexible update of the smoothing parameter

0 references

On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems

0 references

Computational complexity of LCPs associated with positive definite symmetric matrices

0 references

A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems

0 references

Locating a maximally complementary solution of the monotone NCP by using non-interior-point smoothing algorithms

0 references

Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function

0 references

Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP

0 references

A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming

0 references

A non-interior continuation algorithm for the \(P_0\) or \(P*\) LCP with strong global and local convergence properties

0 references

Convergence properties of a non-interior-point smoothing algorithm for the \(P*\)NCP

0 references

Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results

0 references

Q4039868

0 references

A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions

0 references

A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities

0 references

A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution

0 references

A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P0LCPs

0 references

Identifiers

zbMATH Open document ID

1151.65059

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1016/J.AMC.2008.03.027

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:942413