Long-step interior-point algorithms for a class of variational inequalities with monotone operators

DOI10.1023/A:1022683302494zbMath0907.90262OpenAlexW64245953MaRDI QIDQ1264995

K. Appert

Publication date: 11 February 1999

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022683302494

zbMATH Keywords

interior-point methodsNewton methodbarrier functionsmonotone variational inequalitiesself-concordant operators

Mathematics Subject Classification ID

Nonlinear programming (90C30) Variational inequalities (49J40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Programming in abstract spaces (90C48)

Related Items (3)

A path-following cutting plane method for some monotone variational inequalities^∗ ⋮ Convergence of a non-interior smoothing method for variational inequality problems ⋮ Coupling the auxiliary problem principle and epiconvergence theory to solve general variational inequalities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A scaling technique for finding the weighted analytic center of a polytope
• On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
• Interior-point methods for convex programming
• Global linear convergence of a path-following algorithm for some monotone variational inequality problems
• Interior point techniques in optimization. Complementarity, sensitivity and algorithms
• An analytic center cutting plane method for pseudomonotone variational inequalities
• Primal-dual target-following algorithms for linear programming
• A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
• Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
• A globally convergent Newton method for solving strongly monotone variational inequalities
• Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method

This page was built for publication: Long-step interior-point algorithms for a class of variational inequalities with monotone operators