Results 251 to 260 of about 2,967,183 (293)

On affine scaling and semi-infinite programming

Mathematical Programming, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael C. Ferris, Andrew B. Philpott
openaire   +2 more sources

Semi-Infinite Programming: Theory, Methods, and Applications

SIAM Review, 1993
Summary: Starting from a number of motivating and abundant applications in \(\S 2\), including control of robots, eigenvalue computations, mechanical stress of materials, and statistical design, the authors describe a class of optimization problems which are referred to a semi-infinite, because their constraints bound functions of a finite number of ...
Rainer Hettich, Kenneth O. Kortanek
openaire   +1 more source

Semi-Infinite Programming and Applications to Minimax Problems

Annals of Operations Research, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stanislav Zakovic, Berç Rustem
openaire   +2 more sources

Semi-infinite Programming

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

Randomized Algorithms for Semi-Infinite Programming Problems

2003 European Control Conference (ECC), 2003
In this paper, we explore the possibility of applying Monte Carlo methods (i.e., randomization) to semi-infinite programming problems. Equivalent stochastic optimization problems are derived for a general class of semi-infinite programming problems. For the equivalent stochastic optimization problems, algorithms based on stochastic approximation and ...
V B Tadic, S P Meyn, R Tempo
openaire   +6 more sources

On Nesterov's Approach to Semi-infinite Programming

Acta Applicandae Mathematica, 2002
The author generalizes the Nesterov's construction for the reduction of various classes of optimization problems to the semidefinite programming form. The author shows that all Nesterov's results can be generalized to `cones of squares' generated by arbitrary bilinear maps between finite-dimensional vector spaces.
openaire   +1 more source

SIPAMPL

ACM Transactions on Mathematical Software, 2004
SIPAMPL is an environment for coding semi-infinite programming (SIP) problems. This environment includes a database containing a set of SIP problems that have been collected from the literature and a set of routines. It allows users to code their own SIP problems in AMPL, to use any problem already in the database, and to develop and test any SIP ...
A. Ismael F. Vaz, Edite M. G. P. Fernandes, M. Paula S. F. Gomes   +2 more
openaire   +2 more sources

Perfect duality in semi–infinite and semidefinite programming

Mathematical Programming, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kenneth O. Kortanek, Qinghong Zhang
openaire   +2 more sources

Discretization in semi-infinite programming: the rate of convergence

Mathematical Programming, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Semi-infinite Multiobjective Fractional Programming I

2017
In 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