Generalizations of methods of best approximation to convex optimization in locally convex spaces. II: hyperbolic theorems

Convex programming (90C25) Nonlinear programming (90C30) Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Related Items (11)

Optimization by level set methods. III: Characterizations of solutions in the presence of duality ⋮ A general theory of dual optimization problems ⋮ Lagrangian duality theorems for reverse convex infimization ⋮ A general theory of surrogate dual and perturbational extended surrogate dual optimization problems ⋮ Maximization of lower semi-continuous convex functionals on bounded subsets of locally convex spaces. I: Hyperplane theorems ⋮ Duality theorems for linear systems and convex systems ⋮ A class of generalised minimum effort problems in locally convex linear topological spaces ⋮ Maximization of lower semi-continuous convex functionals on bounded subsets of locally convex spaces. II: Quasi-Lagrangian duality theorems ⋮ Duality theorems for perturbed convex optimization ⋮ Best approximation and optimization ⋮ Surrogate dual problems and surrogate Lagrangians

Cites Work

This page was built for publication: Generalizations of methods of best approximation to convex optimization in locally convex spaces. II: hyperbolic theorems