Long-step primal path-following algorithm for monotone variational inequality problems
type: Item
instance of: scholarly article
title: Long-step primal path-following algorithm for monotone variational inequality problems
zbMATH Open document ID: 0911.90312
DOI: 10.1023/A:1021786630040
author: K. Appert
published in: Journal of Optimization Theory and Applications
publication date: 1999-05-17T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 1239684
zbMATH Keywords: mathematical programming
zbMATH Keywords: variational inequalities
zbMATH Keywords: Newton method
zbMATH Keywords: interior-point methods
zbMATH Keywords: barrier-function methods
zbMATH Keywords: long-step primal path-following algorithm
zbMATH Keywords: global convergence
MaRDI profile type: Publication
cites work: Iterative methods for variational and complementarity problems
cites work: An iterative scheme for variational inequalities
cites work: Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
cites work: On the convergence of projection methods: Application to the decomposition of affine variational inequalities
cites work: Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
cites work: A globally convergent Newton method for solving strongly monotone variational inequalities
cites work: A general descent framework for the monotone variational inequality problem
cites work: Newton's Method for B-Differentiable Equations
cites work: A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
cites work: A new polynomial-time algorithm for linear programming
cites work: Q3491304
cites work: An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
cites work: Insights into the interior-point methods
cites work: On some efficient interior point methods for nonlinear convex programming
cites work: Global linear convergence of a path-following algorithm for some monotone variational inequality problems
cites work: A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems
cites work: Q4016509
cites work: A path following algorithm for a class of convex programming problems
cites work: Q4296156
cites work: Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems
full work available at URL: a:1021786630040
OpenAlex ID: W180137006
description: scientific article; zbMATH DE number 1239684