A comparison of solution approaches for the numerical treatment of or-constrained optimization problems

DOI10.1007/s10589-020-00169-zzbMath1461.65175arXiv1905.01893MaRDI QIDQ1986109

Patrick Mehlitz

Publication date: 7 April 2020

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.01893

zbMATH Keywords

global convergence; disjunctive programming; relaxation methods; NCP-functions; or-constrained programming

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C30: Nonlinear programming

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

Uses Software

• Ipopt