Optimization Online


Primal-Dual Entropy Based Interior-Point Algorithms for Linear Optimization

Mehdi Karimi(m7karimi***at***uwaterloo.ca)
Shen Luo(shenluo***at***alumni.uwaterloo.ca)
Levent Tuncel(ltuncel***at***uwaterloo.ca)

Abstract: We propose a family of search directions based on primal-dual entropy in the context of interior-point methods for linear optimization. We show that by using entropy based search directions in the predictor step of a predictor-corrector algorithm together with a homogeneous self-dual embedding, we can achieve the current best iteration complexity bound for linear optimization. Then, we focus on some wide neighborhood algorithms and show that in our family of entropy based search directions, we can find the best search direction and step size combination by performing a plane search at each iteration. For this purpose, we propose a heuristic plane search algorithm as well as an exact one. Finally, we perform computational experiments to study the performance of entropy-based search directions in wide neighborhoods of the central path, with and without utilizing the plane search algorithms.


Category 1: Linear, Cone and Semidefinite Programming (Linear Programming )

Citation: arXiv:1410.8226

Download: [PDF]

Entry Submitted: 11/27/2014
Entry Accepted: 11/27/2014
Entry Last Modified: 11/27/2014

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 Optimization Society