A Generic Path-Following Algorithm with a Sliding Constraint and its Application to Linear Programming and the Computation of Analytic Centers
We propose a generic path-following scheme which is essentially a method of centers that can be implemented with a variety of algorithms. The complexity estimate is computed on the sole assumption that a certain local quadratic convergence property holds, independently of the specific algorithmic procedure in use, primal, dual or primal-dual.
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:||1996|
|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/Email:
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:fth:ehecge:96.08. 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.