Results 121 to 130 of about 1,754 (168)
Some of the next articles are maybe not open access.
Semi-Infinite Programming: Theory, Methods, and Applications
SIAM Review, 1993Summary: 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 ...
Hettich, R., Kortanek, K. O.
openaire +1 more source
Robot trajectory planning with semi-infinite programming
European Journal of Operational Research, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vaz, A. Ismael F. +2 more
openaire +1 more source
Randomized Algorithms for Semi-Infinite Programming Problems
2003 European Control Conference (ECC), 2003In 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
Linear (Semi-) Infinite Programs and Cooperative Games
2005In 1975 Stef Tijs defended his Ph.D. thesis entitled “Semi-infinite and infinite matrix games and bimatrix games ?. Following this, his paper “Semi-infinite linear programs and semi-infinite matrix games ? was pub- lished in 1979. Both these works deal with programs and noncoopera- tive games in a (semi-)infinite setting.
Timmer, Judith B., Llorca, Natividad
openaire +2 more sources
Non-linear semi-infinite programming
1992Optimisation problems occur in many branches of science, engineering, and economics, as well as in other areas. The diversity of the various types of optimisation problems is extremely large, and so a unified approach is not attempted here. This thesis concentrates on a specific type of problem: non-linear semi-infinite programming.
openaire +2 more sources
General Semi-infinite Programming Problems
2011We study general semi-infinite programming problems (GSIP) from the topological point of view. Introducing the symmetric Mangasarian-Fromovitz constraint qualification (Sym-MFCQ) for GSIPs, we describe the closure of the GSIP feasible set. It is proved that Sym-MFCQ is stable and generic. Moreover, under Sym-MFCQ, the GSIP feasible set is shown to be a
openaire +1 more source
Semi-Infinite Programming in Control
1998Optimal control problems represent a special class of optimization problems which describe dynamical processes. There is a wide range of applications for optimal control problems in engineering and economics. A few of these problems are described and it is shown how they are related and lead to semi-infinite programming problems.
openaire +1 more source
On Nesterov's Approach to Semi-infinite Programming
Acta Applicandae Mathematica, 2002The 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
Semidefinite and Semi-infinite Programming
2019This chapter discusses optimization problems in the cone of positive semidefinite matrices, and the duality theory for such ‘linear’ problems. We relate convex rotationally invariant matrix functions to convex functions of the spectrum; this allows us to compute the conjugate of the logarithmic barrier function and the dual of associate optimization ...
openaire +1 more source