Optimization Online


A T-algebraic approach to primal-dual interior-point algorithms

Chek Beng Chua(cbchua***at***ntu.edu.sg)

Abstract: Three primal-dual interior-point algorithms for homogeneous cone programming are presented. They are a short-step algorithm, a large-update algorithm, and a predictor-corrector algorithm. These algorithms are described and analyzed based on a characterization of homogeneous cone via T-algebra. The analysis show that the algorithms have polynomial iteration complexity.

Keywords: Homogeneous cone programming; T-algebra; Primal-dual interior-point algorithm

Category 1: Convex and Nonsmooth Optimization (Convex Optimization )

Category 2: Linear, Cone and Semidefinite Programming (Other )

Citation: Division of Mathematical Sciences, Nanyang Technological University, December 2006

Download: [PDF]

Entry Submitted: 11/30/2006
Entry Accepted: 12/01/2006
Entry Last Modified: 11/30/2006

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