Homogeneous Analytic Center Cutting Plane Methods with Approximate Centers
In this paper we consider a homogeneous analytic center cutting plabne method in a projective space. We describe a general scheme that uses a homogeneous oracle and computes an approximate analytic center at each iteration. This technique is applied to a convex feasibility problem, to variational inequalities, and to convex constrained minimization. We prove that these problems can be solved with the same order of complexity as in the case of exact analytic centers.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||1998|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: (+ 41 22) 705-8263
Fax: (+ 41 22) 705-8293
Web page: http://www.unige.ch/gsem/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:fth:ehecge:98.3. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.