Pages that link to "Item:Q364738"
From MaRDI portal
The following pages link to Subgradient projection algorithms and approximate solutions of convex feasibility problems (Q364738):
Displaying 5 items.
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods (Q494329) (← links)
- Subgradient projection algorithms for convex feasibility problems in the presence of computational errors (Q741092) (← links)
- Iterative algorithm for solving a class of convex feasibility problem (Q1736385) (← links)
- The extension of the linear inequality method for generalized rational Chebyshev approximation to approximation by general quasilinear functions (Q5077162) (← links)
- Multivariate approximation by polynomial and generalized rational functions (Q5077169) (← links)
