Variational inequalities and optimization problems



Liu, Yina
Variational inequalities and optimization problems. PhD thesis, University of Liverpool.

[img] Text
thesis_Yina Liu(200830462).pdf - Unspecified
Access to this file is embargoed until Unspecified.
Available under License Creative Commons Attribution.

Download (503kB)
[img] Text
LiuYin_Oct2015_2031959.pdf - Unspecified
Available under License Creative Commons Attribution.

Download (503kB)

Abstract

The main purpose of this thesis is to study weakly sharp solutions of a variational inequality and its dual problem. Based on these, we present finite convergence algorithms for solving a variational inequality problem and its dual problem. We also construct the connection between variational inequalities and engineering problems. We consider a variational inequality problem on a nonempty closed convex subset of R^n. In order to solve this variational inequality problem, we construct the equivalence between the solution set of a variational inequality and optimization problems by using two gap functions, one is the primal gap function and the other is the dual gap function. We give properties of these two gap functions. We discuss su�cient conditions for the subdifferentiability of the primal gap function of a variational inequality problem. Moreover, we characterize relations between the G^ateaux differentiabilities of primal and dual gap functions. We also build some results for the Lipschitz and locally Lipschitz properties of primal and dual gap functions as well. Afterwards, several su�cient conditions for the relevant mapping to be constant on the solution set of a variational inequality has been obtained, including the relations between solution sets of a variational inequality and its dual problem as well as the optimal solution sets to gap functions. Based on these, we characterize weak sharpness of the solution set of a variational inequality by its primal gap function g and its dual gap function G. In particular, we apply error bounds of g, G and g + G on C. We also construct finite convergence of algorithms for solving a variational inequality by considering the convergence of a local projection. We carry out these results in terms of the weak sharpness of solution sets of a variational inequality as well as the error bounds of gap functions of a variational inequality problem.

Item Type: Thesis (PhD)
Additional Information: Date: 2015-10-05 (completed)
Depositing User: Symplectic Admin
Date Deposited: 21 Jan 2016 16:13
Last Modified: 17 Dec 2022 01:33
DOI: 10.17638/02031959
URI: https://livrepository.liverpool.ac.uk/id/eprint/2031959