In this paper we study optimization problems with infinite many inequality constraints on a Banach space where the objective function and the binding constraints are locally Lipschitz‎. ‎Necessary optimality conditions and regularity conditions are given‎. ‎Our approach are based on the Michel-Penot subdifferential.

Coalgebraic Logic Programming (CoALP) is a dialect of Logic programming designed to work with coinductive definitions of infinite objects. Its main goal is to introduce guarded lazy corecursion akin functional theorem provers into logic programming. In this paper, we give the first full formal account of guarded corecursion in CoALP, and present its implementation.

The paper deals with a risk averse dynamic programming problem infinite horizon. First, the required assumptions are formulated to have well defined. Then Bellman equation is derived, which may be also seen as standalone reinforcement learning problem. fact that operator contraction proved, guaranteeing convergence of various solution algorithms used for problems, we demonstrate on value iterat...

‎This paper describes a new optimization method for solving continuous semi-infinite linear problems‎. ‎With regard to the dual properties‎, ‎the problem is presented as a measure theoretical optimization problem‎, ‎in which the existence of the solution is guaranteed‎. ‎Then‎, ‎on the basis of the atomic measure properties‎, ‎a computation method was presented for obtaining the near optimal so...

For a nonsmooth multiobjective mathematical programming problem governed by infinitely many constraints‎, ‎we define a new gap function that generalizes the definitions of this concept in other articles‎. ‎Then‎, ‎we characterize the efficient‎, ‎weakly efficient‎, ‎and properly efficient solutions of the problem utilizing this new gap function‎. ‎Our results are based on $(Phi,rho)-$invexity‎,...