An approximation of feasible sets in semi-infinite optimization.
The paper deals with the feasible set \(M:=\{x\in\mathbb{R}^{n}\mid h_{i}(x)=0,\;i\in I,\;G(x,y)\leq0,\) \(y\in Y\}\) of a semi-infinite optimization problem, where \(I\) is a finite set, \(Y\subset\mathbb{R}^{r}\) is a compact set and \(h_{i}\in C^{2}(\mathbb{R}^{n},\mathbb{R})\) for \(i\in I\) and \(G\in C^{2}(\mathbb{R}^{n}\times\mathbb{R}^{r},\mathbb{R}).\) Under the extended Mangasarian-Fromovitz constraint qualification condition, assumed to hold at every \(x\in M,\) it is shown that there exist an open subset \(U\) of \(\mathbb{R}^{r}\) with \(M\subset U\) and a unique continuous function \(x^{\ast }:U\rightarrow M\) with \(\left\| z-x^{\ast}(z)\right\| =d_{M}(z)\) (the distance from \(z\) to \(M\)) and \(z\in N(x^{\ast}(z))\) (the normal cone of \(M\) at \(x^{\ast}(z)\)) such that the restriction of \(d_{M}^{2}\) to \(U\) is continuously differentiable and \(Dd_{M}^{2}(z)=2(z-x^{\ast}(z))\) for \(z\in U.\)
- Semi-infinite optimization: Structure and stability of the feasible set
- The feasible set in generalized semi-infinite optimization
- scientific article; zbMATH DE number 1431629
- Characterization of the feasible set mapping in one class of semi-infinite optimization problems.
- scientific article; zbMATH DE number 3896692
- Existence and Differentiability of Metric Projections in Hilbert Spaces
- scientific article; zbMATH DE number 3755766 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- Metric regularity of the feasible set mapping in semi-infinite optimization
- On existence and uniqueness of stationary points in semi-infinite optimization
- On stability and stationary points in nonlinear optimization
- One-Parametric Semi-Infinite Optimization: On the Stability of the Feasible Set
- Optimization and nonsmooth analysis
- Optimization. Algorithms and consistent approximations
- Semi-infinite optimization: Structure and stability of the feasible set
- Semi-infinite programming. Recent advances
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- Semi-Infinite Programming: Theory, Methods, and Applications
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Semi-infinite optimization: Structure and stability of the feasible set
- Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization
- On feasible sets for MPC and their approximations
- Characterization of the feasible set mapping in one class of semi-infinite optimization problems.
- Smoothing by mollifiers. I: Semi-infinite optimization
This page was built for publication: An approximation of feasible sets in semi-infinite optimization.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1871423)