Optimal value function in semi-infinite programming
We provide a systematic approach to the main topics in linear semi- infinite programming by means of a new methodology based on the many properties of the subdifferential mapping and the closure of a given convex function. In particular, we deal with the duality gap problem and its relation with the discrete approximation of the semi-infinite program. Moreover, we have precised the conditions that allow us to eliminate the duality gap by introducing a perturbation in the primal objective function. As a byproduct, we supply different extensions of well-known results concerning the subdifferential mapping.
- scientific article; zbMATH DE number 1506667
- scientific article; zbMATH DE number 4095211
- On duality in semi-infinite programming and existence theorems for linear inequalities
- Some results on Lipschitz properties of the optimal values in semi-infinite programming
- scientific article; zbMATH DE number 4114367
- A duality theorem for semi-infinite convex programs and their finite subprograms
- An implementation of a discretization method for semi-infinite programming
- An Infinite Linear Program with a Duality Gap
- Continuity properties in semi-infinite parametric linear optimization
- Convex Analysis
- Duality gaps in semi-infinite linear programming—an approximation problem
- DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
- Farkas-Minkowski systems in semi-infinite programming
- scientific article; zbMATH DE number 3724209 (Why is no real title available?)
- scientific article; zbMATH DE number 3755766 (Why is no real title available?)
- Newton's method for convex programming and Tschebyscheff approximation
- Numerical treatment of a class of semi‐infinite programming problems
- Reduction and Discrete Approximation in Linear Semi-Infinite Programming
- On duality in semi-infinite programming and existence theorems for linear inequalities
- Conditions for the uniqueness of the optimal solution in linear semi- infinite programming
- How to deal with the unbounded in optimization: Theory and algorithms
- Stability of the duality gap in linear optimization
- Recent contributions to linear semi-infinite optimization
- Recent contributions to linear semi-infinite optimization: an update
- The stability of the maximum entropy method for nonsmooth semi-infinite programmings
- Marco A. López, a pioneer of continuous optimization in Spain
- Optimal value functions of generalized semi-infinite min-max programming on a noncompact set
- Some results on Lipschitz properties of the optimal values in semi-infinite programming
- scientific article; zbMATH DE number 4035566 (Why is no real title available?)
- scientific article; zbMATH DE number 4095211 (Why is no real title available?)
- scientific article; zbMATH DE number 1506667 (Why is no real title available?)
- VALUE FUNCTION AND OPTIMALITY CONDITIONS
- Linear conic and two-stage stochastic optimization revisited via semi-infinite optimization
- Convergence of stationary sequences for variational inequalities with maximal monotone operators
- On the optimal value function for certain linear programs with unbounded optimal solution sets
- Semi-infinite programming
- A new smoothing Newton-type algorithm for semi-infinite programming
This page was built for publication: Optimal value function in semi-infinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1093526)
