Results 261 to 270 of about 16,647 (299)

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   +1 more source

On Exchange Methods for Nonlinear Semi-Infinite Programs

Asia-Pacific Journal of Operational Research, 2021
A new exchange method is presented for semi-infinite optimization problems with polyhedron constraints. The basic idea is to use an active set strategy as exchange rule to construct an approximate problem with finitely many constraints at each iteration.
Liping Zhang 0008, Shouqiang Du
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   +1 more source

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

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   +5 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

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

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

Subdifferentials of Marginal Functions in Semi-infinite Programming

SIAM Journal on Optimization, 2010
This paper proposes two new constraint qualification conditions (CQs) which are useful for a unified study of CQs from both a convex analysis and a nonsmooth analysis point of view. Our CQs cover the existing CQs of Mangasarian-Fromovitz and Farkas-Minkowski types. Some sufficient conditions for the validity of the new CQs are given.
Thai Doan Chuong, Nguyen Quang Huy, Jen-Chih Yao   +2 more
openaire   +1 more source

Semi-infinite quadratic programming

Operations-Research-Spektrum, 1979
A 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