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

doi:10.1287/ijoc.2016.0715

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

Article Details
Other Related Research

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. In addition, we also find that iOptimize detects infeasibility more reliably than the general nonlinear solvers Ipopt (version 3.9.2) and Knitro (version 8.0).

Authors:

Huang, Kuo -Ling ^[1] ; Mehrotra, Sanjay ^[1]

Northwestern Univ., Evanston, IL (United States)

Publication Date:: 2016-11-08

Grant/Contract Number:: SC0005102

Type:: Accepted Manuscript

Journal Name:: INFORMS Journal on Computing

Additional Journal Information:: Journal Volume: 29; Journal Issue: 1; Journal ID: ISSN 1091-9856

Publisher:: INFORMS

Research Org:: Northwestern Univ., Evanston, IL (United States)

Sponsoring Org:: USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR) (SC-21)

Country of Publication:: United States

Language:: English

Subject:: 97 MATHEMATICS AND COMPUTING; quadratic programs; quadratically constrained quadratic programs; convex programs; homogeneous algorithms; interior point methods

OSTI Identifier:: 1321136


                    Huang, Kuo -Ling, and Mehrotra, Sanjay. Solution of monotone complementarity and general convex programming problems using a modified potential reduction interior point method.  United States: N. p.,  
        Web.  doi:10.1287/ijoc.2016.0715.

Copy to clipboard


                    Huang, Kuo -Ling, & Mehrotra, Sanjay. Solution of monotone complementarity and general convex programming problems using a modified potential reduction interior point method.  United States.  doi:10.1287/ijoc.2016.0715.

Copy to clipboard


                    Huang, Kuo -Ling, and Mehrotra, Sanjay. 2016.  
        "Solution of monotone complementarity and general convex programming problems using a modified potential reduction interior point method".  United States.  
        doi:10.1287/ijoc.2016.0715.  https://www.osti.gov/servlets/purl/1321136.

Copy to clipboard


                    
@article{osti_1321136,

  title        = {Solution of monotone complementarity and general convex programming problems using a modified potential reduction interior point method},

  author       = {Huang, Kuo -Ling and Mehrotra, Sanjay},

  abstractNote = {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. In addition, we also find that iOptimize detects infeasibility more reliably than the general nonlinear solvers Ipopt (version 3.9.2) and Knitro (version 8.0).},

  doi          = {10.1287/ijoc.2016.0715},

  journal      = {INFORMS Journal on Computing},

  number       = 1,

  volume       = 29,

  place        = {United States},

  year         = {2016},

  month        = {11}

}

Copy to clipboard

Free Publicly Accessible Full Text
Accepted Manuscript (DOE)
Publisher's Version of Record
10.1287/ijoc.2016.0715
https://doi.org/10.1287/ijoc.2016.0715

Similar Records

Similar records in DOE PAGES and OSTI.GOV collections:

A globally and superlinearly convergent potential reduction interior point method for convex programming

Technical Report - in OSTI.gov collection Monteiro, R.D. ; Wright, S.J. July 1992

We consider an interior point algorithm for convex programming in which the steps are generated by using a primal-dual affine scaling technique. A ``local`` variant of the algorithm is shown to have superlinearly convergence with q-order up to (but not inducting) 2. The technique is embedded in a potential reduction algorithm and the resulting method is shown to be globally and superlinearly convergent. An important feature of the convergence analysis is its use of a novel strict interiority condition, which generalizes the usual conical neighborhood of the central path.
Non-Interior Continuation Method for Solving the Monotone Semidefinite Complementarity Problem

Journal Article - in OSTI.gov collection Huang, Z.H. ; Han, J. May 2003 - Applied Mathematics and Optimization

Recently, Chen and Tseng extended non-interior continuation smoothing methods for solving linear/ nonlinear complementarity problems to semidefinite complementarity problems (SDCP). In this paper we propose a non-interior continuation method for solving the monotone SDCP based on the smoothed Fischer-Burmeister function, which is shown to be globally linearly and locally quadratically convergent under suitable assumptions. Our algorithm needs at most to solve a linear system of equations at each iteration. In addition, in our analysis on global linear convergence of the algorithm, we need not use the assumption that the Frechet derivative of the function involved in the SDCP is Lipschitzmore »« less
Full Text Available
Solution of a General Linear Complementarity Problem Using Smooth Optimization and Its Application to Bilinear Programming and LCP

Journal Article - in OSTI.gov collection Fernandes, L. ; Friedlander, A. ; Guedes, M. ; ... July 2001 - Applied Mathematics and Optimization

This paper addresses a General Linear Complementarity Problem (GLCP) that has found applications in global optimization. It is shown that a solution of the GLCP can be computed by finding a stationary point of a differentiable function over a set defined by simple bounds on the variables. The application of this result to the solution of bilinear programs and LCPs is discussed. Some computational evidence of its usefulness is included in the last part of the paper.
Full Text Available
A superlinear infeasible-interior-point algorithm for monotone complementarity problems

Technical Report - in OSTI.gov collection Wright, S. ; Ralph, D. November 1996

We use the globally convergent framework proposed by Kojima, Noma, and Yoshise to construct an infeasible-interior-point algorithm for monotone nonlinear complementary problems. Superlinear convergence is attained when the solution is nondegenerate and also when the problem is linear. Numerical experiments confirm the efficacy of the proposed approach.
Full Text Available
An interior point method for general nonlinear programming using trust regions

Conference - in OSTI.gov collection Byrd, R. ; Gilbert, J.C. ; Nocedal, J. December 1994

In this talk we describe ongoing work on an interior point method for general nonlinearly constrained optimization. Our approach is a primal dual method related to those used successfully in linear and convex programming, but is based in part on the trust region method for equality con strained optimization due to Byrd and Omojokun, and developed further by Nocedal and Plantenga. This allows us to use an indefinite Hessian matrix based on exact second derivatives or approximations. Such an approach is expected to be most effective when satisfaction of nonlinear constraints is a major issue. We describe the operation ofmore »« less

Access journal articles and accepted manuscripts resulting from DOE research funding

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

Access journal articles and accepted manuscripts
resulting from DOE research funding