We consider a generalized semi-infinite programming problem (GSIP) with one semi-infinite constraint where the index set depends on the variable to be minimized. Keeping in mind the integral global optimization method of Zheng and Chew and its modifications we would like to outline theoretical ...
Semi-infinite programming (SIP) problems can be efficiently solved by reduction-type methods. Here, we present a new reduction method for SIP, where the multi-local optimization is carried out with a stretched simulated annealing algorithm, the reduced (finite) problem is approximately solved by a...
In this paper, we consider a class of linear-quadratic semi-infinite programming problems. Using the duality theory, the dual problem is obtained, where the decision variables are measures. A new parameterization scheme is developed for approximating these measures. On this bases, an efficient ...
generalized semi-infinite programmingThis article presents a short introduction to semi-infinite programming (SIP), which over the last two decades has become a vivid research area in mathematical programming with a wide range of applications. An SIP problem is characterized by infinitely many ...
In this paper, we consider a class of semi-infinite programming problems with a parameter. As the parameter increases, we prove that the optimal values decrease monotonically. Moreover, the limit of the sequence of optimal values exists as the parameter tends to infinity. In finding the limit,...
We consider the following nonsmooth multiobjective semi-infinite programming problem with vanishing constraints defined on Hadamard manifolds (NMSIPVC):(NMSIPVC)MinimizeΦ(y):=(Φ1(y),…,Φm(y)),subject toΨt(y)≤0,∀t∈T,θj(y)=0,∀j∈J:={1,…,q},Mj(y)≥0,∀j∈S:={1...
E. Polak. An implementable algorithm for the optimal design centering, tolerancing and tuning problem, Journal of Optimization Theory and Appli cations, 37:45–67, 1982. Article MathSciNet MATH Google Scholar R. Reemtsen and J.-J. Rückmann (editors). Semi-Infinite Programming, Kluwer, 1998...
This scheme recasts any $SDP$ with a bounded primal feasible set as an eigenvalue optimization problem. These are convex nonsmooth problems that can be tackled by bundle methods for nondifferentiable optimization. Finally we present the rationale for using the columns of the bundle $P$ ...
Keywords: Semi-in?nite programming; Applications; Linear semi-in?nite programs; Optimality conditions; Numerical methods 1. Introduction 1.1. Problem formulation A semi-in?nite program (SIP) is an optimization problem in ?nitely many variables x ? ?x1 ; . . . ; xn ? 2 Rn on a feasible ...
This paper deals with a nonlinear multiobjective semi-infinite programming problem involving generalized (C,α, ρ, d)-convex functions. We obtain sufficient optimality conditions and formulate the Mond-Weirtype dual model for the nonlinear multiobjective semi-infinite programming problem. We also estab...