Minimax balayage theorem and an inscribed ball problem

DOI10.1007/BF01158823zbMath0568.49007MaRDI QIDQ1060405

A. L. Garkavi

Publication date: 1982

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

nonconvex problemsinscribed ball problembalayage theorem

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Fréchet and Gateaux differentiability in optimization (49J50) Existence of solutions for minimax problems (49J35) Methods involving semicontinuity and convergence; relaxation (49J45) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Duality theory (optimization) (49N15) Convex sets in topological vector spaces (aspects of convex geometry) (52A07)

Related Items

Inspheres and inner products ⋮ Diametral points and diametral pairs in Banach spaces

Cites Work

• Sufficient conditions for extremum, penalty functions and regularity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item