Zur existenz von lösungen konvexer optimierungsaufgaben in lokalkonvexen räumen

DOI10.1080/01630568208816112zbMath0483.49009OpenAlexW2085485694MaRDI QIDQ3941933

Michael Wriedt

Publication date: 1982

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

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

zbMATH Keywords

convex programminglocally convex spaces

Mathematics Subject Classification ID

Methods involving semicontinuity and convergence; relaxation (49J45) General theory of locally convex spaces (46A03) Convex sets in topological vector spaces (aspects of convex geometry) (52A07) Methods of successive quadratic programming type (90C55)

Related Items (1)

Best approximation and optimization

Cites Work

• Maximization of lower semi-continuous convex functionals on bounded subsets of locally convex spaces. I: Hyperplane theorems
• Proximinalität und Algorithmen bei konvexer Approximation
• Unnamed Item

This page was built for publication: Zur existenz von lösungen konvexer optimierungsaufgaben in lokalkonvexen räumen