A \(\mathcal{UV}\)-decomposed method for solving an MPEC problem

DOI10.1007/s10483-008-0412-yzbMath1231.90349OpenAlexW85375958MaRDI QIDQ940607

Li-Mei Zhu, Li-Ping Pang, Zun-Quan Xia, Feng Shan

Publication date: 1 September 2008

Published in: Applied Mathematics and Mechanics. (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10483-008-0412-y

zbMATH Keywords

nonsmooth optimizationsubdifferentialnonlinear programming\(\mathcal{U}\)-Lagrangian\(\mathcal{UV}\)-decompositionMPEC problem

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Related Items

A decomposition method with redistributed subroutine for constrained nonconvex optimization ⋮ A \({\mathcal {VU}}\)-decomposition method for a second-order cone programming problem

Cites Work

• Unnamed Item
• Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
• Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
• Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
• The 𝒰-Lagrangian of a convex function