scientific article; zbMATH DE number 3863948
[For the entire collection see Zbl 0529.00027.] The author continues his research started in the first part [Lect. Notes Pure Appl. Math. 86, 13-43 (1983; Zbl 0522.49010)]. He considers the following problem: given a real locally convex space F, a nonempty subset G of F, and a functional \(h:F\to(-\infty,\infty];\) find a convenient formula for the number \(h(G)\equiv \inf_{g\to G}h(g).\) Under certain assumptions, the set \(G^ s\) used in the first part of the paper is replaced by other subsets of \(G^ s\) and in such a way new duality theorems, which reduce the computation of h(G) to the computation of the infima of h over some support hyperplanes of G, are obtained.
- Optimization by level set methods v:duality theorems for perturbed optimization problems2
- Optimization by level set methods vi:generalizations of surrogate type reverse convex duality
- Some further duality theorems for optimization problems with reverse convex constraint sets
- scientific article; zbMATH DE number 762954
- scientific article; zbMATH DE number 592622
- A general theory of dual optimization problems
- A general theory of surrogate dual and perturbational extended surrogate dual optimization problems
- Optimization by level set methods vi:generalizations of surrogate type reverse convex duality
- On the functional \(\int_\Omega f + \int_{\Omega^\ast} G\)
- Best approximation and optimization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3331802)