A quantitative refinement of the closed graph theorem

DOI10.21136/CMJ.1974.101265MaRDI QIDQ4076324zbMATH OpenOpenAlexFDO

Authors Vlastimil Pták

Publication date 1974

Full work available at URL https://eudml.org/doc/12814

Mathematics Subject Classification ID

Complete metric spaces (54E50) Open mapping and closed graph theorems; completeness (including (B)-, (B_r)-completeness) (46A30)

Cites work

• scientific article; zbMATH DE number 3436155 (Why is no real title available?)
• A theorem of the closed graph type
• On the closed graph theorem

Cited in

(18)

• On superadditive rates of convergence
• Extending the applicability of Newton's method using nondiscrete induction
• On general open mapping theorems
• Infinite products of relations, set-valued series and uniform openness of multifunctions
• scientific article; zbMATH DE number 1066254 (Why is no real title available?)
• An open mapping theorem for families of multifunctions
• Nondiscrete mathematical induction and iterative existence proofs
• Nonlinear regularity models
• Subtraction theorems and approximate openness for multifunctions: Topological and infinitesimal viewpoints
• On primal regularity estimates for single-valued mappings
• A remark on small divisors problems
• An induction theorem and general open mapping theorems
• Verifiable necessary and sufficient conditions for openness and regularity of set-valued and single-valued maps
• An improved nonlinear closed graph theorem
• A local version of the closed graph Lemma of Kelley
• Iterative processes and open mapping theorems
• scientific article; zbMATH DE number 219676 (Why is no real title available?)
• The rate of convergence of Newton's process

This page was built for publication: A quantitative refinement of the closed graph theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4076324)