Proof mining in L₁-approximation
From MaRDI portal
Publication:1874241
Recommendations
- On the Computational Complexity of Best L1-approximation
- Best \(L_ 1\)-approximation
- New effective moduli of uniqueness and uniform a priori estimates for constants of strong unicity by logical analysis of known proofs in best approximation theory
- Approximation in the mean by convex functions
- Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation
Cites work
- A constructive development of Chebyshev approximation theory
- A QUANTITATIVE VERSION OF A THEOREM DUE TO BORWEIN-REICH-SHAFRIR
- An Elementary Proof of Jackson's Theorem on Mean-Approximation
- Effective bounds from ineffective proofs in analysis: An application of functional interpretation and majorization
- Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation
- Error estimates and Lipschitz constants for best approximation in continuous function spaces
- scientific article; zbMATH DE number 956475 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 3536667 (Why is no real title available?)
- scientific article; zbMATH DE number 1215497 (Why is no real title available?)
- scientific article; zbMATH DE number 1226875 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 1746038 (Why is no real title available?)
- scientific article; zbMATH DE number 3258269 (Why is no real title available?)
- scientific article; zbMATH DE number 2236640 (Why is no real title available?)
- Lipschitz Constants and Moduli of Continuity for the Chebyshev Projection
- Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
- New effective moduli of uniqueness and uniform a priori estimates for constants of strong unicity by logical analysis of known proofs in best approximation theory
- On Strong Unicity of L 1 -Approximation
- On the computational complexity of best Chebyshev approximations
- On the Computational Complexity of Best L1-approximation
- On the continuity of best approximations in the space of integrable functions
- Some theorems on Cebysev approximation
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
Cited in
(17)- Moduli of regularity and rates of convergence for Fejér monotone sequences
- Fundamental notions of analysis in subsystems of second-order arithmetic
- An application of proof mining to nonlinear iterations
- Bounded functional interpretation
- Minimum propositional proof length is NP-hard to linearly approximate
- scientific article; zbMATH DE number 5859846 (Why is no real title available?)
- New effective moduli of uniqueness and uniform a priori estimates for constants of strong unicity by logical analysis of known proofs in best approximation theory
- 2003 Annual Meeting of the Association for Symbolic Logic
- On the Computational Complexity of Best L1-approximation
- Some logical metatheorems with applications in functional analysis
- PROOF MINING IN Lp SPACES
- scientific article; zbMATH DE number 7178366 (Why is no real title available?)
- 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09
- Bounds on strong unicity for Chebyshev approximation with bounded coefficients
- BLOOM: bimodal lattice one-out-of-many proofs and applications
- Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation
- Uniform functional interpretations
This page was built for publication: Proof mining in \(L_{1}\)-approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1874241)
