‎linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints‎. ‎in this paper‎, ‎to solve this problem‎, ‎we combine a discretization method and a neural network method‎. ‎by a simple discretization of the infinite constraints,we convert the linear semi-infinite programming problem into linear programming problem‎. ‎then‎, ‎we use...

starting from two-dimensional (2d) equations of motion, discretized formulations for transient behavior of soil-structure interaction problems have been derived. two different dynamic infinite elements taking into account single and two-wave types are presented in transformed space. by coupling the infinite elements with standard finite elements, an ordinary finite element procedure is used for...

We first consider subsmoothness for a function family and provide formulas of the subdifferential of the pointwsie supremum of a family of subsmooth functions. Next, we consider subsmooth infinite and semi-infinite optimization problems. In particular, we provide several dual and primal characterizations for a point to be a sharp minimum or a weak sharp minimum for such optimization problems.

This study is concerned with the formulation of three dimensional mapped infinite elements with 1/r and 1/ decay types. These infinite elements are coupled with conventional finite elements and their application to some problems of soil structure interaction are discussed. The effeciency of the coupled finite-infinite elements formulation with respect to computational effort, data preparation a...

In this paper, we investigate the convergence of a sequence of minimizing trajectories in infinite horizon optimization problems. The convergence is considered in the sense of ideals and their particular case called the statistical convergence. The optimality is defined as a total cost over the infinite horizon.