Methods of centers for variational inequalities and linear programming

DOI10.1016/S0096-3003(97)10135-7zbMath1060.90699OpenAlexW2030802088MaRDI QIDQ1294369

M. E. Primak, Boris L. Kheyfets

Publication date: 1998

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0096-3003(97)10135-7

Mathematics Subject Classification ID

Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Unified complexity analysis for Newton LP methods
• Complexity of circumscribed and inscribed ellipsoid methods for solving equilibrium economical models
• On the complexity of approximating the maximal inscribed ellipsoid for a polytope
• A modification of the inscribed ellipsoid method
• Rapidly convergent modification of the method of chebyshev centers
• A Potential Reduction Algorithm Allowing Column Generation
• A central cutting plane algorithm for the convex programming problem
• Location of the Maximum on Unimodal Surfaces
• Sequential Minimax Search for a Maximum
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Methods of centers for variational inequalities and linear programming