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 paper we test different conjugate gradient (CG) methods for solving largescale unconstrained optimization problems. The methods are divided in two groups: the first group includes five basic ...

The problem is mathematically transformed into a Quadratic Unconstrained Binary Optimization (QUBO) problem, which was successfully solved on an IBM quantum computer and a D-Wave quantum annealer.” ...

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