Results 111 to 120 of about 1,754 (168)
Some of the next articles are maybe not open access.
Copositive Programming via Semi-Infinite Optimization
Journal of Optimization Theory and Applications, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ahmed, Faizan +2 more
openaire +2 more sources
Feasible Method for Semi-Infinite Programs
SIAM Journal on Optimization, 2015Summary: A new numerical method is presented for semi-infinite optimization problems which guarantees that each iterate is feasible for the original problem. The basic idea is to construct concave relaxations of the lower level problem, to compute the optimal values of the relaxation problems explicitly, and to solve the resulting approximate problems ...
Wang, Shuxiong, Yuan, Yaxiang
openaire +2 more sources
Interval Methods for Semi-Infinite Programs
Computational Optimization and Applications, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bhattacharjee, Binita +2 more
openaire +2 more sources
Augmented Lagrangians in semi-infinite programming
Mathematical Programming, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rückmann, Jan-J., Shapiro, Alexander
openaire +1 more source
Semi-infinite quadratic programming
Operations-Research-Spektrum, 1979A method is presented for minimizing a definite quadratic function under an infinite number of linear inequality restrictions. Special features of the method are that it generates a sequence of feasible solutions and a sequence of basic solutions simultaneously and that it has very favourable properties concerning numerical stability.
openaire +2 more sources
2010
Semi-infinite programs are constrained optimization problems in which the number of decision variables is finite, but the number of constraints is infinite. In this chapter, we treat a class semi-infinite programming problems in which the constraints are indexed by a compact set.
openaire +1 more source
Semi-infinite programs are constrained optimization problems in which the number of decision variables is finite, but the number of constraints is infinite. In this chapter, we treat a class semi-infinite programming problems in which the constraints are indexed by a compact set.
openaire +1 more source
On generalized semi-infinite programming
Top, 2006This paper surveys some basic properties of the class of generalized semi-infinite programming problems (GSIP) where the infinite index set of inequality constraints depends on the state variables and all emerging functions are assumed to be continuously differentiable. There exists a wide range of applications which can be modelled as a (GSIP).
Jan -J. Rückmann, Juan Alfredo Gómez
openaire +1 more source
Generalized semi-infinite programming: Theory and methods
European Journal of Operational Research, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Feasible Method for Generalized Semi-Infinite Programming
Journal of Optimization Theory and Applications, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stein, O., Winterfeld, A.
openaire +2 more sources
Semi-infinite Multiobjective Fractional Programming I
2017In this chapter, we first present three new classes of generalized convex functions involving Hadamard directional derivatives, namely, (strictly) (\(\mathcal {F},\) \(\beta ,\) \(\phi ,\) \(\rho ,\) \(\eta ,\) \(\theta ,\) \(\mu \))-Hd-univex functions, (strictly) (\(\mathcal {F},\) \(\beta ,\) \(\phi ,\) \(\rho ,\) \(\eta ,\) \(\theta ,\) \(\mu ...
openaire +1 more source