The Analytic Center Quadratic Cut Method for Strongly Monotone Variational Inequality Problems
From MaRDI portal
Recommendations
- Approximate analytic center quadratic cut method for strongly monotone variational inequalities
- A proximal analytic center cutting plane algorithm for solving variational inequality problems
- A fast-convergent method for solving strongly monotone variational inequality problems
- Quadratic convergence of a long-step interior-point method for nonlinear monotone variational inequality problems
- An analytic center cutting plane method for pseudomonotone variational inequalities
Cited in
(8)- Quadratic convergence of a long-step interior-point method for nonlinear monotone variational inequality problems
- Solving variational inequalities with a quadratic cut method: a primal-dual, Jacobian-free approach
- Solving variational inequalities defined on a domain with infinitely many linear constraints
- A fast-convergent method for solving strongly monotone variational inequality problems
- Approximate analytic center quadratic cut method for strongly monotone variational inequalities
- The Orthogonality Theorem and the Strong-f-Monotonicity Condition for Variational Inequality Algorithms
- A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
- A second-order cone cutting surface method: Complexity and application
This page was built for publication: The Analytic Center Quadratic Cut Method for Strongly Monotone Variational Inequality Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943937)
