Long-step primal path-following algorithm for monotone variational inequality problems
From MaRDI portal
Publication:1275718
DOI10.1023/A:1021786630040zbMath0911.90312OpenAlexW180137006MaRDI QIDQ1275718
Publication date: 17 May 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:1021786630040
global convergencevariational inequalitiesinterior-point methodsNewton methodmathematical programmingbarrier-function methodslong-step primal path-following algorithm
Related Items (3)
Solving asymmetric variational inequalities via convex optimization ⋮ Convergence of the approximate auxiliary problem method for solving generalized variational inequalities ⋮ Coupling the auxiliary problem principle and epiconvergence theory to solve general variational inequalities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- On some efficient interior point methods for nonlinear convex programming
- A general descent framework for the monotone variational inequality problem
- Global linear convergence of a path-following algorithm for some monotone variational inequality problems
- On the convergence of projection methods: Application to the decomposition of affine variational inequalities
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- A globally convergent Newton method for solving strongly monotone variational inequalities
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
- Newton's Method for B-Differentiable Equations
- Iterative methods for variational and complementarity problems
- Insights into the interior-point methods
- A path following algorithm for a class of convex programming problems
- A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems
- Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems
- An iterative scheme for variational inequalities
This page was built for publication: Long-step primal path-following algorithm for monotone variational inequality problems
