Optimization Online


MPCC Strategies for Nonsmooth NLPs

Kexin Wang(kxwang***at***zju.edu.cn)
Lorenz Biegler(biegler***at***cmu.edu)

Abstract: This paper develops solution strategies for large-scale nonsmooth optimization problems. We transform nonsmooth programs into equivalent mathematical programs with complementarity constraints (MPCCs), and then employ NLP-based strategies for their so- lution. For this purpose, two NLP formulations based on complementarity relaxations are put forward, one of which applies a parameterized formulation and operates with a bound- ing algorithm, with the aim of taking advantage of the NLP sensitivities in search for the solution; and the other relates closely to the well-studied Lin-Fukushima formulation. With appropriate assumptions, the resulting solution of the proposed formulations is proved to be C- and M-stationary for the MPCC problems. Numerical performance of the proposed formulations, and the formulations by Lin & Fukushima and Scholtes are studied and com- pared, with selected examples from the MacMPEC collection and two large-scale distillation cases.

Keywords: MPCC, NLP, smoothing functions, stationarity conditions

Category 1: Convex and Nonsmooth Optimization (Nonsmooth Optimization )

Category 2: Complementarity and Variational Inequalities

Citation: CAPD Report B-26-21, Center for Advanced Process Decision-Making, Carnegie Mellon University, 10/21

Download: [PDF]

Entry Submitted: 10/19/2021
Entry Accepted: 10/19/2021
Entry Last Modified: 10/19/2021

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