Long-step interior-point algorithms for a class of variational inequalities with monotone operators
type: Item
instance of: scholarly article
title: Long-step interior-point algorithms for a class of variational inequalities with monotone operators
zbMATH Open document ID: 0907.90262
DOI: 10.1023/A:1022683302494
author: K. Appert
published in: Journal of Optimization Theory and Applications
publication date: 1999-02-11T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 49J40
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C48
zbMATH DE Number: 1206536
zbMATH Keywords: monotone variational inequalities
zbMATH Keywords: interior-point methods
zbMATH Keywords: Newton method
zbMATH Keywords: barrier functions
zbMATH Keywords: self-concordant operators
MaRDI profile type: Publication
cites work: Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
cites work: An analytic center cutting plane method for pseudomonotone variational inequalities
cites work: Interior point techniques in optimization. Complementarity, sensitivity and algorithms
cites work: Q4324980
cites work: Q4353550
cites work: Global linear convergence of a path-following algorithm for some monotone variational inequality problems
cites work: A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
cites work: Q4296156
cites work: Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method
cites work: Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
cites work: Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
cites work: Q4735039
cites work: Interior-point methods for convex programming
cites work: A globally convergent Newton method for solving strongly monotone variational inequalities
cites work: On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
cites work: A scaling technique for finding the weighted analytic center of a polytope
cites work: Primal-dual target-following algorithms for linear programming
full work available at URL: a:1022683302494
OpenAlex ID: W64245953
description: scientific article; zbMATH DE number 1206536