Algorithmic schemes for non-smooth simple bilevel programming problem and simple MPEC problem

DOI10.1080/02331934.2023.2230991MaRDI QIDQ6606311FDO

Authors Stephan Dempe, Joydeep Dutta, T. Pandit

Publication date 16 September 2024

Published in Optimization (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Recommendations

• Algorithms for simple bilevel programming
• Simple bilevel programming and extensions
• On solving simple bilevel programs with a nonconvex lower level program
• A smoothing augmented Lagrangian method for solving simple bilevel programs
• Single-level reformulations of a specific non-smooth bilevel programming problem and their applications

Cites work

• scientific article; zbMATH DE number 439380 (Why is no real title available?)
• scientific article; zbMATH DE number 7030501 (Why is no real title available?)
• scientific article; zbMATH DE number 5176444 (Why is no real title available?)
• A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
• Convex Analysis
• Proximal Point Algorithm Controlled by a Slowly Vanishing Term: Applications to Hierarchical Minimization
• Set-valued mappings and enlargement of monotone operators.
• Simple bilevel programming and extensions
• VI-constrained hemivariational inequalities: distributed algorithms and power control in ad-hoc networks

This page was built for publication: Algorithmic schemes for non-smooth simple bilevel programming problem and simple MPEC problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606311)