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

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. 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

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

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

OSTI Identifier:: 1321136

Grant/Contract Number:: SC0005102

Resource 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

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

Citation Formats


                    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., 2016. 
        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. Tue .  
        "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

Journal Article:

Free Publicly Available Full Text

Accepted Manuscript (DOE)

Publisher's Version of Record

DOI: 10.1287/ijoc.2016.0715

Other availability

Search WorldCat to find libraries that may hold this journal

Save / Share:

Export Metadata

Save to My Library

Works referencing / citing this record:

A homogeneous model for monotone mixed horizontal linear complementarity problems
journal, September 2018

Petra, Cosmin G.; Potra, Florian A.
Computational Optimization and Applications, Vol. 72, Issue 1
DOI: 10.1007/s10589-018-0035-x

Similar Records in DOE PAGES and OSTI.GOV collections:

SU-F-T-340: Direct Editing of Dose Volume Histograms: Algorithms and a Unified Convex Formulation for Treatment Planning with Dose Constraints

Journal Article Ungun, B ; Stanford University School of Medicine, Stanford, CA ; Fu, A ; ... - Medical Physics

Purpose: To develop a procedure for including dose constraints in convex programming-based approaches to treatment planning, and to support dynamic modification of such constraints during planning. Methods: We present a mathematical approach that allows mean dose, maximum dose, minimum dose and dose volume (i.e., percentile) constraints to be appended to any convex formulation of an inverse planning problem. The first three constraint types are convex and readily incorporated. Dose volume constraints are not convex, however, so we introduce a convex restriction that is related to CVaR-based approaches previously proposed in the literature. To compensate for the conservatism of this restriction,more »« less
DOI: 10.1118/1.4956525
MO-FG-CAMPUS-TeP2-01: A Graph Form ADMM Algorithm for Constrained Quadratic Radiation Treatment Planning

Journal Article Liu, X ; Belcher, AH ; Wiersma, R - Medical Physics

Purpose: In radiation therapy optimization the constraints can be either hard constraints which must be satisfied or soft constraints which are included but do not need to be satisfied exactly. Currently the voxel dose constraints are viewed as soft constraints and included as a part of the objective function and approximated as an unconstrained problem. However in some treatment planning cases the constraints should be specified as hard constraints and solved by constrained optimization. The goal of this work is to present a computation efficiency graph form alternating direction method of multipliers (ADMM) algorithm for constrained quadratic treatment planning optimizationmore »« less
DOI: 10.1118/1.4957359
A computational study of the use of an optimization-based method for simulating large multibody systems.

Journal Article Petra, C ; Gavrea, B ; Anitescu, M ; ... - Optimization Methods and Software

The present work aims at comparing the performance of several quadratic programming (QP) solvers for simulating large-scale frictional rigid-body systems. Traditional time-stepping schemes for simulation of multibody systems are formulated as linear complementarity problems (LCPs) with copositive matrices. Such LCPs are generally solved by means of Lemke-type algorithms and solvers such as the PATH solver proved to be robust. However, for large systems, the PATH solver or any other pivotal algorithm becomes unpractical from a computational point of view. The convex relaxation proposed by one of the authors allows the formulation of the integration step as a QPD, for whichmore »« less
DOI: 10.1080/10556780902806094
Non-Interior Continuation Method for Solving the Monotone Semidefinite Complementarity Problem

Journal Article Huang, Z H ; Han, J - 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
DOI: 10.1007/S00245-003-0765-7
Solving convex (and linear) complementarity problems by projection methods (undamped Newton)

Conference Garcia-Palomares, U M

A recent approach for solving the Linear Complementarity Problem (LCP) has been the solution of an equivalent system of piecewise linear equations through damped Newton methods. Since these functions are not everywhere differentiable, Newton methods have been adapted to deal with B-differentiable functions. The main drawback of this approach is the need to globalize the results by means of a step-size procedure. We adapt a new method of projections on certain convex sets to solve the LCP. This approach becomes a Newton method with no need of stepsize. Both the theoretical and practical implications are encouraging. The convergence conditions extendmore »« less

Similar Records

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

Abstract

Citation Formats

A homogeneous model for monotone mixed horizontal linear complementarity problems journal, September 2018

A homogeneous model for monotone mixed horizontal linear complementarity problems
journal, September 2018