A global optimization approach for solving non-monotone variational inequality problems
MendAmar Majig, B. Barsbold, Rentsen Enkhbat, Masao Fukushima
Abstract
MendAmar Majig, B. Barsbold, Rentsen Enkhbat, Masao Fukushima
Abstract
The aim of this article is to reformulate the non-monotone variational inequality problem as a global optimization problem and present a branch and bound method for solving it. Under a mild condition, it is shown that the equivalent optimization problem enjoys a Lipschitz property. The proposed approach is illustrated with computational experiments.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The aim of this article is to reformulate the non-monotone variational inequality problem as a global optimization problem and present a branch and bound method for solving it. Under a mild condition, it is shown that the equivalent optimization problem enjoys a Lipschitz property. The proposed approach is illustrated with computational experiments.
Key concepts: Mathematics, Monotone polygon, Variational inequality, Lipschitz continuity, Mathematical optimization, Optimization problem, Property (philosophy), Inequality