Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/45072
Title: Global linear and local quadratic convergence of a long-step adaptive-mode interior point method for some monotone variational inequality problems
Authors: Sun, J. 
Zhao, G. 
Keywords: Interior point methods
Monotone variational inequality problems
Polynomial complexity of algorithms
Rate of convergence
Issue Date: 1998
Source: Sun, J.,Zhao, G. (1998). Global linear and local quadratic convergence of a long-step adaptive-mode interior point method for some monotone variational inequality problems. SIAM Journal on Optimization 8 (1) : 123-139. ScholarBank@NUS Repository.
Abstract: An interior point (IP) method is proposed to solve variational inequality problems for monotone functions and polyhedral sets. The method has the following advantages: 1. Given an initial interior feasible solution with duality gap μ0, the algorithm requires at most O[n log(μ0/ε)] iterations to obtain an ε-optimal solution. 2. The rate of convergence of the duality gap is q-quadratic. 3. At each iteration, a long-step improvement is allowed. 4. The algorithm can automatically transfer from a linear mode to a quadratic mode to accelerate the local convergence.
Source Title: SIAM Journal on Optimization
URI: http://scholarbank.nus.edu.sg/handle/10635/45072
ISSN: 10526234
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

89
checked on Dec 15, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.