Optimization problems often involve situations in which the user's goal is to minimize and/or maximize not a single objective function, but several, usually conflicting, functions simultaneously. Such ...

A line of engineering research seeks to develop computers that can tackle a class of challenges called combinatorial optimization problems. These are common in real-world applications such as ...

In the context of mass higher education, Chinese application-oriented undergraduate institutions face significant teaching challenges stemming from the increasingly diverse student population. This ...

Abstract: Optimization problems aim to identify the best solution from a wide range of possibilities. The Particle Swarm Optimization (PSO) algorithm is widely recognized for its simplicity and ...

ABSTRACT: In this paper, we investigate the convergence of the generalized Bregman alternating direction method of multipliers (ADMM) for solving nonconvex separable problems with linear constraints.

ABSTRACT: The alternating direction method of multipliers (ADMM) and its symmetric version are efficient for minimizing two-block separable problems with linear constraints. However, both ADMM and ...

Alan Veliz-Cuba has received funding from the Simons Foundation and the American Mathematical Society for some of his research. You can probably think of a time when you’ve used math to solve an ...