In this paper we will extend the input-to-state stability (ISS) framework to continuous-time discontinuous dynamical systems adopting Filippov’s solution concept and using non-smooth ISS Lyapunov functions. The main motivation for adopting non-smooth ISS Lyapunov functions is that “multiple Lyapunov functions” are commonly used in the stability theory for hybrid systems. We will show that the e...

When Fourier techniques are employed to specific option pricing cases from computational finance with non-smooth functions, the so-called Gibbs phenomenon may become apparent. This seriously impacts the efficiency and accuracy of the pricing. For example, the Variance Gamma asset price process gives rise to algebraically decaying Fourier coefficients, resulting in a slowly converging Fourier se...

This paper presents a computational impact angle control guidance law based on the energy cost weighted by arbitrary functions in order to shape acceleration command as desired. The optimal problem is established frame and solved Gauss orthogonal collocation method. proposed formulated from generalized framework, thus new that allows achieving specific goal can be easily obtained way of devisin...

In this paper, we address a cooperative game application to supply chain management. Specifically, we study a distribution system where a set of retailers may order for a single product from a unique supplier to satisfy a deterministic and constant rate demand of final customers. Each retailer, when ordering for a quantity of product, has to pay a fixed ordering cost and a transportation cost. ...

This study investigates the global optimality of approximate dynamic programming (ADP) based solutions using neural networks for optimal control problems with fixed final time. Issues including whether or not the cost function terms and the system dynamics need to be convex functions with respect to their respective inputs are discussed and sufficient conditions for global optimality of the res...

Most 3D shape analysis methods use triangular meshes to discretize both the shape and functions on it as piecewise linear functions. With this representation, shape analysis requires fine meshes to represent smooth shapes and geometric operators like normals, curvatures, or LaplaceBeltrami eigenfunctions at large computational and memory costs. We avoid this bottleneck with a compression techni...

Interactive submodular set cover is an interactive variant of submodular set cover over a hypothesis class of submodular functions, where the goal is to satisfy all sufficiently plausible submodular functions to a target threshold using as few (cost-weighted) actions as possible. It models settings where there is uncertainty regarding which submodular function to optimize. In this paper, we pro...

This paper presents a novel population-based meta-heuristic algorithm inspired by the game of tug of war. Utilizing a sport metaphor the algorithm, denoted as Tug of War Optimization (TWO), considers each candidate solution as a team participating in a series of rope pulling competitions.  The  teams  exert  pulling  forces  on  each  other...