Analytic center cutting plane methods for variational inequalities over convex bodies

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

An analytic center cutting plane method is an iterative algorithm based on the computation of analytic centers. In this paper, we propose some analytic center cutting plane methods for solving quasimonotone or pseudomonotone variational inequalities whose domains are bounded or unbounded convex bodies.

References Powered by Scopus

Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications

1495Citations
N/AReaders
Get full text

A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization

211Citations
N/AReaders
Get full text

Complexity analysis of an interior cutting plane method for convex feasibility problems

102Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Proximal Analytic Center Cutting Plane Algorithms for Variational Inequalities and Nash Economic Equilibrium

0Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Zeng, R. (2018). Analytic center cutting plane methods for variational inequalities over convex bodies. Journal of Inequalities and Applications, 2018. https://doi.org/10.1186/s13660-018-1666-2

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 3

100%

Readers' Discipline

Tooltip

Medicine and Dentistry 1

33%

Mathematics 1

33%

Linguistics 1

33%

Save time finding and organizing research with Mendeley

Sign up for free