scientific article

From MaRDI portal

Revision as of 07:06, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3668370

Jump to:navigation, search

zbMath0519.49022MaRDI QIDQ3668370

Rainer Hettich

Publication date: 1983

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

cutting plane method exchange method discretization theory

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Newton-type methods (49M15) Linear programming (90C05) Semi-infinite programming (90C34) Discrete approximations in optimal control (49M25)

Related Items (12)

Convergent Algorithms for a Class of Convex Semi-infinite Programs ⋮ Some outer approximation methods for semi-infinite optimization problems ⋮ An interior semi-infinite programming method ⋮ An implementation of a discretization method for semi-infinite programming ⋮ Geometric fundamentals of the simplex method in semi-infinite programming ⋮ A ladder method for linear semi-infinite programming ⋮ Relax-and-split method for nonconvex inverse problems ⋮ On stable uniqueness in linear semi-infinite optimization ⋮ Variational analysis on local sharp minima via exact penalization ⋮ A semi-infinite programming method for approximating load duration curves by polynomials ⋮ An extension of the simplex algorithm for semi-infinite linear programming ⋮ A projected lagrangian algorithm for semi-infinite programming

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3668370&oldid=17131237"