Duality theorems for linear systems and convex systems
From MaRDI portal
Publication:1145348
DOI10.1016/0022-247X(80)90037-2zbMath0445.49007MaRDI QIDQ1145348
Publication date: 1980
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
93C05: Linear systems in control theory
90C48: Programming in abstract spaces
49J45: Methods involving semicontinuity and convergence; relaxation
49J27: Existence theories for problems in abstract spaces
Related Items
Surrogate dual problems and surrogate Lagrangians, A general theory of dual optimization problems, 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 perturbed convex optimization, Abstract pontryagin maximum principles for linear systems
Cites Work
- Maximization of lower semi-continuous convex functionals on bounded subsets of locally convex spaces. I: Hyperplane theorems
- A characterization of constant-time linear control systems satisfying the Pontryagin maximum principle
- Maximization of lower semi-continuous convex functionals on bounded subsets of locally convex spaces. II: Quasi-Lagrangian duality theorems
- Generalizations of methods of best approximation to convex optimization in locally convex spaces. II: hyperbolic theorems
- Stetigkeit von Optimierungsoperatoren
- Some new applications of the Fenchel-Rockafellar duality theorem: Lagrange multiplier theorems and hyperplane theorems for convex optimization and best approximation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item