In this paper, we propose an algorithm for solving inequality constrained mini-max optimization problem. In this algorithm, an active set strategy is used together with multiplier method to convert ...

Tour of the most important data structures, fundamental algorithms, and algorithm design techniques: lists, stacks, queues, dynamic arrays, hash tables, priority queues, disjoint set unions, binary ...