Convex semi-infinite parametric programming: Uniform convergence of the optimal value functions of discretized problems
From MaRDI portal
Publication:1293961
DOI10.1023/A:1021779213028zbMath0956.90054OpenAlexW12173359WikidataQ104129323 ScholiaQ104129323MaRDI QIDQ1293961
Publication date: 29 June 1999
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021779213028
discretizationparametric optimizationcontinuityuniform convergencerational approximationoptimal value functionsemi-infinite programmingdefect minimization methods
Related Items (2)
On the continuity of the optimal value in parametric linear optimization: Stable discretization of the Lagrangian dual of nonlinear problems ⋮ Linear semi-infinite programming theory: an updated survey
Cites Work
- Unnamed Item
- Unnamed Item
- Discretization methods for the solution of semi-infinite programming problems
- Some outer approximation methods for semi-infinite optimization problems
- Optimization. Algorithms and consistent approximations
- The Newton differential correction algorithm for rational Chebyshev approximation with constrained denominators
- Accurate Numerical Approximations of Eigenfrequencies and Eigenfunctions of Elliptic Membranes
- Semi-Infinite Programming: Theory, Methods, and Applications
- Parametric semi-infinite linear programming I. continuity of the feasible set and of the optimal value
- An Algorithm for General Restricted Rational Chebyshev Approximation
- An implementation of a discretization method for semi-infinite programming
- Directional derivatives for the value-function in semi-infinite programming
- One-sided derivatives for the value function in convex parametric programming
- Optimization Problems with Perturbations: A Guided Tour
This page was built for publication: Convex semi-infinite parametric programming: Uniform convergence of the optimal value functions of discretized problems
