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 23 items.
- An infeasible-point subgradient method using adaptive approximate projections (Q461434) (← links)
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods (Q494329) (← links)
- Finite \(\varepsilon\)-subgradient algorithm for approximate solution of the parametric programming problem (Q684974) (← links)
- Subgradient projection algorithms for convex feasibility problems in the presence of computational errors (Q741092) (← links)
- Extensions of subgradient projection algorithms (Q1089262) (← links)
- Approximate Rolle's theorems for the proximal subgradient and the generalized gradient. (Q1404904) (← links)
- Iterative algorithm for solving a class of convex feasibility problem (Q1736385) (← links)
- Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures (Q2260660) (← links)
- Properties of subgradient projection iteration when applying to linear imaging system (Q2329650) (← links)
- Solving for (approximate) convex feasibility under finite precision (Q2866598) (← links)
- Convergence of projection algorithms to approximate solutions of convex feasibility problems (Q2906313) (← links)
- An extrapolated parallel subgradient projection algorithm with centering technique for the convex feasibility problem (Q2927188) (← links)
- On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces (Q3629520) (← links)
- (Q3743106) (← links)
- (Q3974343) (← links)
- (Q3984868) (← links)
- (Q4233330) (← links)
- Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour (Q4613990) (← links)
- Subgradient method with feasible inexact projections for constrained convex optimization problems (Q5045169) (← 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)
- A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors (Q5346620) (← links)
- Approximate subgradients and coderivatives in \(R^ n\) (Q5961473) (← links)