Optimization by level set methods v:duality theorems for perturbed optimization problems2

DOI10.1080/02331938408842904zbMath0538.49004OpenAlexW2074699420MaRDI QIDQ3324516

Ivan Singer

Publication date: 1984

Published in: Mathematische Operationsforschung und Statistik. Series Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938408842904

zbMATH Keywords

locally convex spacesubdifferentialslevel setssurrogate dualityLagrangian dual problems

Mathematics Subject Classification ID

Sensitivity, stability, well-posedness (49K40) Programming in abstract spaces (90C48) Duality theory (optimization) (49N15) General theory of locally convex spaces (46A03) Optimality conditions for problems in abstract spaces (49K27)

Related Items

A general theory of dual optimization problems, A general theory of surrogate dual and perturbational extended surrogate dual optimization problems, Level sets and the minimal time function of linear control processes, Some further relations between unperturbational and perturbational dual optimization problems, Quasiconvex duality theory by generalized conjugation methods, Conjugate functionals and level sets, Some general Lagrangian duality theorems, Best approximation and optimization