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 ...

In this work, we present a robust optimization method that is suited for unconstrained problems with a nonconvex cost function as well as for problems based on simulations, such as large partial ...

In addition, the book includes an introduction to artificial neural networks, convex optimization, multi-objective optimization and applications of optimization in machine learning. About the Purdue ...