A new decomposition algorithm for globally solving mathematical programs with affine equilibrium constraints

zbMath1248.49042arXiv1105.3343MaRDI QIDQ445789

Le Dung Muu, Tao Pham Dinh, Hoai An Le Thi, Quoc Tran Dinh

Publication date: 27 August 2012

Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)

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

zbMATH Keywords

global optimizationregularizationbilevel convex quadratic programmingDC formulationmathematical programs with affine equilibrium constraintsNash-Cournot model

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Decomposition methods (49M27) Numerical methods for variational inequalities and related problems (65K15)

Related Items

Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach ⋮ DC Programming and DCA for General DC Programs ⋮ A study of the difference-of-convex approach for solving linear programs with complementarity constraints

This page was built for publication: A new decomposition algorithm for globally solving mathematical programs with affine equilibrium constraints