Optimization Online


A primal-dual interior-point method based on various selections of displacement step for second-order cone programming

Baha Alzalg(baha2math***at***gmail.com)

Abstract: In this paper, a primal-dual interior-point method equipped with various selections of the displacement step are derived for solving second-order cone programming problems. We first establish the existence and uniqueness of the optimal solution of the corresponding perturbed problem and then demonstrate its convergence to the optimal solution of the original problem. Next, we present four different selections to calculate the displacement step. We also establish the convergence of the proposed algorithm and present its complexity result. Finally, the four selections of calculating the displacement step are compared in numerical examples to show the efficiency of the proposed algorithm.

Keywords: Second-order cone programming, interior-point methods, primal-dual methods, central trajectory methods, Jordan algebras.

Category 1: Linear, Cone and Semidefinite Programming (Second-Order Cone Programming )

Citation: The University of Jordan. June 1, 2017

Download: [PDF]

Entry Submitted: 06/01/2017
Entry Accepted: 06/01/2017
Entry Last Modified: 06/01/2017

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