Homogeneous analytic center cutting plane methods with approximate centers

Abstract : In this paper we consider a homogeneous analytic center cutting plane 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. For the feasibility and the minimization problems rough approximations suffice, but very high precision is required for the variational inequalities. We give an example of variational inequality where even the first analytic center needs to be computed with a precision matching the precision required for the solution.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01232542
Contributor : Olivier Péton <>
Submitted on : Monday, November 23, 2015 - 4:29:44 PM
Last modification on : Tuesday, December 4, 2018 - 10:42:03 AM

Identifiers

Citation

Yurii E. Nesterov, Olivier Péton, Jean-Philippe Vial. Homogeneous analytic center cutting plane methods with approximate centers. Optimization Methods and Software, Taylor & Francis, 1999, Special Issue: Interior Point Methods (CD supplement with software). Guest Editors: Florian Potra, Cornelis Roos and Tamas Terlaky, 11 (1-4), pp.243-273. ⟨http://www.tandfonline.com/doi/abs/10.1080/10556789908805753?journalCode=goms20⟩. ⟨10.1080/10556789908805753⟩. ⟨hal-01232542⟩

Share

Metrics

Record views

47