Minimax optimization problems arises from both modern machine learning including
generative adversarial networks, adversarial training and multi-agent reinforcement …

Abstract The Karush–Kuhn–Tucker and value function (lower-level value function, to be
precise) reformulations are the most common single-level transformations of the bilevel …

In this paper, we revisit the classical problem of solving over-determined systems of
nonsmooth equations numerically. We suggest a nonsmooth Levenberg–Marquardt method …

It is well known that there have been many numerical algorithms for solving nonsmooth
minimax problems; however, numerical algorithms for nonsmooth minimax problems with …

In this work we derive a second-order approach to bilevel optimization, a type of
mathematical programming in which the solution to a parameterized optimization problem …

We propose a new approach to solving bilevel optimization problems, intermediate between
solving full-system optimality conditions with a Newton-type approach, and treating the inner …

The purpose of this paper is to derive primal and dual second-order necessary optimality
conditions for a standard bilevel optimization problem with both smooth and nonsmooth …

Designing robotic manipulators for generic tasks while meeting specific requirements is a
complex, iterative process involving mechanical design, simulation, control, and testing …

The $1-N $ generalized Stackelberg game (single-leader multi-follower game) is intricately
intertwined with the interaction between a leader and followers (hierarchical interaction) and …

We consider a parametric quasi-variational inequality (QVI) without any convexity
assumption. Using the concept of optimal value function, we transform the problem into that …