Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...
ABSTRACT. We consider equilibrium constrained optimization problems, which have a general formulation that encompasses well-known models such as mathematical programs with equilibr...
S. Ilker Birbil, Gemayqzel Bouza, J. B. G. Frenk, ...
Abstract. Optimization problems constrained by nonlinear partial differential equations have been the focus of intense research in scientific computing lately. Current methods for...
Ernesto E. Prudencio, Richard H. Byrd, Xiao-Chuan ...
Several inverse problems exist in the atmospheric sciences that are computationally costly when using traditional gradient based methods. Unfortunately, many standard evolutionary ...
Monte Lunacek, L. Darrell Whitley, Philip Gabriel,...
three different levels of abstraction: detailed models including ctivity dynamics, weight dynamics that abstract from the neural activity dynamics by an adiabatic approximation, an...