Solution of monotone complementarity and general convex programming problems using a modified potential reduction interior point method

Kuo Ling Huang, Sanjay Mehrotra

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

We present a homogeneous algorithm equipped with a modified potential function for the monotone complementarity problem. We show that this potential function is reduced by at least a constant amount if a scaled Lipschitz condition (SLC) is satisfied. A practical algorithm based on this potential function is implemented in a software package named iOptimize. The implementation in iOptimize maintains global linear and polynomial time convergence properties, while achieving practical performance. It either successfully solves the problem, or concludes that the SLC is not satisfied. When compared with the mature software package MOSEK (barrier solver version 6.0.0.106), iOptimize solves convex quadratic programming problems, convex quadratically constrained quadratic programming problems, and general convex programming problems in fewer iterations. Moreover, several problems for which MOSEK fails are solved to optimality. We also find that iOptimize detects infeasibility more reliably than the general nonlinear solvers Ipopt (version 3.9.2) and Knitro (version 8.0).

Original languageEnglish (US)
Pages (from-to)36-53
Number of pages18
JournalINFORMS Journal on Computing
Volume29
Issue number1
DOIs
StatePublished - Dec 1 2017

Keywords

  • Convex programs
  • Homogeneous algorithms
  • Interior point methods
  • Quadratic programs
  • Quadratically constrained quadratic programs

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Computer Science Applications
  • Management Science and Operations Research

Fingerprint

Dive into the research topics of 'Solution of monotone complementarity and general convex programming problems using a modified potential reduction interior point method'. Together they form a unique fingerprint.

Cite this