ON CONVERGENCE IN DISCRETIZED MINIMIZATION PROBLEMS*
DOI10.1081/NFA-100105309zbMath0992.65049OpenAlexW2094315503MaRDI QIDQ2769520
Publication date: 1 September 2002
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1081/nfa-100105309
convergenceminimization problemsnonlinear equationnormed spacesconvex functionalelliptic boundary value problemnonlinear Chebyshev approximationconvergent discretizationsnonlinear defect minimizationnorm residual minimization problem
Numerical mathematical programming methods (65K05) General theory of numerical analysis in abstract spaces (65J05) Variational methods involving nonlinear operators (47J30) Approximation methods and heuristics in mathematical programming (90C59) Best approximation, Chebyshev systems (41A50)
Cites Work
- Unnamed Item
- Unnamed Item
- On discretization in generalized rational approximation
- Discretely uniform approximation of continuous functions
- On discretization errors in nonlinear approximation problems
- Best approximation with respect to nearby norms
- Die Bedeutung der Normalität bei rationaler Tschebyscheff-Approximation
- On the continuity of rational approximation operators
- Convergence of convex sets and of solutions of variational inequalities
- Diskrete Konvergenz linearer Operatoren. I
- Perturbations of best approximation problems
- Discrete approximation of extremal problems with operator inequality constraints
- Discrete approximations of minimization problems. I. Theory
- Discrete approximations of minimization problems. II. Applications
- Über lineare approximationsreguläre Operatoren
- Über diskrete Approximationen nichtlinearer Gleichungen 1. Art
- Approximative methods for nonlinear equations (two approaches to the convergence problem)
- Zur Theorie linearer approximationsregulärer Operatoren. I
This page was built for publication: ON CONVERGENCE IN DISCRETIZED MINIMIZATION PROBLEMS*
