Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German

zbMath0526.90058MaRDI QIDQ594764

Klaus Glashoff, Sven-Åke Gustafson

Publication date: 1983

Published in: Applied Mathematical Sciences (Search for Journal in Brave)

zbMATH Keywords

polynomial approximationexistence of solutionssimplex algorithmuniform approximationsemi-infinite programminglinear optimizationbest approximationsgeneralized quadrature rules of Gaussian type

Mathematics Subject Classification ID

Linear programming (90C05) Best approximation, Chebyshev systems (41A50) Semi-infinite programming (90C34) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Duality theory (optimization) (49N15) Numerical quadrature and cubature formulas (65D32) Duality theory for topological vector spaces (46A20) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control (49-01)

Related Items (53)

Some sufficient efficiency conditions in semiinfinite multiobjective fractional programming based on exponential type invexities ⋮ Continuous Markov equilibria with quasi-geometric discounting ⋮ Interior-point algorithms for semi-infinite programming ⋮ Generalized corner optimal solution for LSIP: existence and numerical computation ⋮ The global control of nonlinear elliptic equations ⋮ A new general mathematical framework for bioluminescence tomography ⋮ Boundedness relations in linear semi-infinite programming ⋮ Linear programming with a possibilistic objective function ⋮ An implementation of a discretization method for semi-infinite programming ⋮ Stochastic linear programming games with concave preferences ⋮ A bird's eye-view of min-max and max-min functionals ⋮ Semi-infinite programming ⋮ Geometric fundamentals of the simplex method in semi-infinite programming ⋮ An interior point algorithm for semi-infinite linear programming ⋮ Fuzzy optimization: An appraisal ⋮ Some continuous programming problems in numerical analysis ⋮ Recent contributions to linear semi-infinite optimization ⋮ A linear technique for designing optimal rotated shapes ⋮ A Tikhonov regularization method for Cauchy problem based on a new relaxation model ⋮ Global parametric sufficient efficiency conditions for semiinfinite multiobjective fractional programming problems containing generalized \((\alpha,\eta,\rho)\)-V-invex functions ⋮ Regularization of a Parameter Estimation Problem using Monotonicity and Convexity Constraints ⋮ Solving a nonlinear inverse Robin problem through a linear Cauchy problem ⋮ Generalized semi-infinite programming: a tutorial ⋮ Relaxed cutting plane method for solving linear semi-infinite programming problems ⋮ On the numerical treatment of linearly constrained semi-infinite optimization problems ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ Bounding contingent claim prices via hedging strategy with coherent risk measures ⋮ Smoothing by mollifiers. I: Semi-infinite optimization ⋮ Continuous minimax optimization using modal intervals ⋮ Constructing accurate linear approximations to a class of exponential interpolation problems ⋮ Strong duality and sensitivity analysis in semi-infinite linear programming ⋮ An upper bound on the expectation of simplicial functions of multivariate random variables ⋮ An alternative approach to the refined duality theory of geometric programming ⋮ A purification algorithm for semi-infinite programming ⋮ Partially finite convex programming. II: Explicit lattice models ⋮ Dynamic linear programming games with risk-averse players ⋮ On subsidiary problems in geometric programming ⋮ An accelerated central cutting plane algorithm for linear semi-infinite programming ⋮ The optimal control of nonlinear diffusion equations with rough initial data ⋮ Model reduction of uncertain systems retaining the uncertainty structure ⋮ On the Smoothness of Convex Envelopes ⋮ Cyclic convex bodies and optimization moment problems ⋮ The global control of a nonlinear wave equation ⋮ Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint ⋮ On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems ⋮ An extension of the simplex algorithm for semi-infinite linear programming ⋮ Posynomial geometric programming as a special case of semi-infinite linear programming ⋮ The set of target vectors in a semi-infinite linear program with a duality gap ⋮ On duality in semi-infinite programming and existence theorems for linear inequalities ⋮ Global parametric sufficient optimality conditions for semi-infinite discrete minmax fractional programming problems involving generalized \((\eta ,\rho )\)-invex functions ⋮ On Haar's dual problem ⋮ Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming ⋮ A coupled complex boundary method for parameter identification in elliptic problems

This page was built for publication: Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German