Analytic center cutting plane methods for variational inequalities over convex bodies
From MaRDI portal
(Redirected from Publication:824529)
convex bodypseudomonotonicityquasimonotonicityvariational inequalityanalytic center cutting plane method
Convex programming (90C25) Linear programming (90C05) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Variational inequalities (49J40) Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex sets without dimension restrictions (aspects of convex geometry) (52A05)
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.
Recommendations
- An analytic center cutting plane method for pseudomonotone variational inequalities
- On the solution of variational inequality problems by using cutting plane methods
- On a primal-dual analytic center cutting plane method for variational inequalities
- The analytic-center cutting-plane method for variational inequalities: a quadratic-cut approach
- Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities
Cites work
- scientific article; zbMATH DE number 3511879 (Why is no real title available?)
- A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
- A cutting plane method for solving quasimonotone variational inequalities
- A cutting plane method from analytic centers for stochastic programming
- A generalized hybrid steepest descent method and applications
- A long-step, cutting plane algorithm for linear and convex programming
- A modified subgradient extragradient method for solving monotone variational inequalities
- A proximal analytic center cutting plane algorithm for solving variational inequality problems
- An analytic center cutting plane method for pseudomonotone variational inequalities
- An analytic center cutting plane method for solving semi-infinite variational inequality problems
- An entropic regularization approach for mathematical programs with equilibrium constraints
- Analytic centers and repelling inequalities
- Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
- Cutting-plane method based on epigraph approximation with discarding the cutting planes
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Inverse cutting plane methods for optimization problems with second-order stochastic dominance constraints
- Multiple cuts in the analytic center cutting plane method
- Some methods based on the D-gap function for solving monotone variational inequalities
Cited in
(8)- The analytic-center cutting-plane method for variational inequalities: a quadratic-cut approach
- An analytic center cutting plane method for solving semi-infinite variational inequality problems
- Solving variational inequalities with a quadratic cut method: a primal-dual, Jacobian-free approach
- A proximal analytic center cutting plane algorithm for solving variational inequality problems
- An analytic center cutting plane algorithm for finding equilibrium points
- scientific article; zbMATH DE number 1488009 (Why is no real title available?)
- Homogeneous analytic center cutting plane methods with approximate centers
- Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities
This page was built for publication: Analytic center cutting plane methods for variational inequalities over convex bodies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q824529)
