Optimization Online


Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones

Bharath Kumar Rangarajan (br47***at***cornell.edu)

Abstract: We establish polynomial-time convergence of infeasible-interior-point methods for conic programs over symmetric cones using a wide neighborhood of the central path. The convergence is shown for a commutative family of search directions used in Schmieta and Alizadeh. These conic programs include linear and semidefinite programs. This extends the work of Rangarajan and Todd, which established convergence of infeasible-interior-point methods for self-scaled conic programs using the NT direction.

Keywords: Infeasible-Interior-Point Methods, Symmetric Cones, Euclidean Jordan Algebras, Polynomial Convergence

Category 1: Linear, Cone and Semidefinite Programming

Category 2: Nonlinear Optimization


Download: [PDF]

Entry Submitted: 04/05/2004
Entry Accepted: 04/05/2004
Entry Last Modified: 04/05/2004

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society