An analytic center cutting plane method for pseudomonotone variational inequalities
From MaRDI portal
Publication:1374377
DOI10.1016/S0167-6377(96)00029-6zbMath0899.90157WikidataQ128113102 ScholiaQ128113102MaRDI QIDQ1374377
Patrice Marcotte, Jean-Louis Goffin, Dao-Li Zhu
Publication date: 18 November 1998
Published in: Operations Research Letters (Search for Journal in Brave)
interior point methodscutting planesanalytic center algorithmgeneralized monotone variational inequalities
Variational inequalities (49J40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Analytic center cutting plane methods for variational inequalities over convex bodies ⋮ Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem ⋮ Solving variational inequalities defined on a domain with infinitely many linear constraints ⋮ Master problem approximations in Dantzig-Wolfe decomposition of variational inequality problems with applications to two energy market models ⋮ Models and Software for Urban and Regional Transportation Planning: The Contributions of the Center for Research on Transportation ⋮ A proximal analytic center cutting plane algorithm for solving variational inequality problems ⋮ An extragradient-type algorithm for non-smooth variational inequalities ⋮ A path-following cutting plane method for some monotone variational inequalities∗ ⋮ Solving variational inequalities with a quadratic cut method: a primal-dual, Jacobian-free approach ⋮ Benders decomposition for a class of variational inequalities ⋮ Generalized invex monotonicity and its role in solving variational-like inequalities ⋮ Pseudomonotone\(_*\) maps and the cutting plane property ⋮ Long-step interior-point algorithms for a class of variational inequalities with monotone operators ⋮ Homogeneous analytic center cutting plane methods with approximate centers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving combinatorial optimization problems using Karmarkar's algorithm
- A note on some analytic center cutting plane methods for convex feasibility and minimization problems
- Combined relaxation methods for finding equilibrium points and solving related problems
- New classes of generalized monotonicity
- A unifying geometric solution framework and complexity analysis for variational inequalities
- Complexity estimates of some cutting plane methods based on the analytic barrier
- On the Solution of Variational Inequalities by the Ellipsoid Method
- Invariance properties of generalized monotonicity
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
- Multi-Valued Monotone Nonlinear Mappings and Duality Mappings in Banach Spaces
