Interior-point algorithms for monotone affine variational inequalities
DOI10.1007/BF02190057zbMATH Open0813.90114OpenAlexW2086070068MaRDI QIDQ1338552FDOQ1338552
Authors: Michael C. Ferris, Menglin Cao
Publication date: 1 December 1994
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02190057
Recommendations
- A polynomial-time algorithm for affine variational inequalities
- scientific article; zbMATH DE number 1894985
- An interior-point-type iterative method for variational inequality problems
- An interior point method for solving monotone linear complementarity problem
- On the dynamical solution of finite-dimensional variational inequalities by an interior point method
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Variational inequalities (49J40)
Cites Work
- Convex Analysis
- Title not available (Why is that?)
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- A polynomial-time algorithm for a class of linear complementarity problems
- Generalized Linear Complementarity Problems
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
Cited In (4)
This page was built for publication: Interior-point algorithms for monotone affine variational inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1338552)