The following pages link to (Q4718793):
Displaying 50 items.
- Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy (Q2020314) (← links)
- Bregman forward-backward operator splitting (Q2047252) (← links)
- Assignment flow for order-constrained OCT segmentation (Q2054391) (← links)
- Upper and lower bounds for the Bregman divergence (Q2067703) (← links)
- Bregman primal-dual first-order method and application to sparse semidefinite programming (Q2070334) (← links)
- The finite sample properties of sparse M-estimators with pseudo-observations (Q2075446) (← links)
- Improved local search algorithms for Bregman \(k\)-means and its variants (Q2084627) (← links)
- A generalized block-iterative projection method for the common fixed point problem induced by cutters (Q2089887) (← links)
- Probability envelopes and their Dempster-Shafer approximations in statistical matching (Q2092458) (← links)
- Limits of eventual families of sets with application to algorithms for the common fixed point problem (Q2158836) (← links)
- A real-time iterative projection scheme for solving the common fixed point problem and its applications (Q2168968) (← links)
- Optimal minimal variation control with quality constraint for fed-batch fermentation processes involving multiple feeds (Q2200149) (← links)
- Unsupervised assignment flow: label learning on feature manifolds by spatially regularized geometric assignment (Q2203373) (← links)
- Column-oriented algebraic iterative methods for nonnegative constrained least squares problems (Q2225527) (← links)
- An explicit algorithm for solving monotone variational inequalities (Q2238840) (← links)
- Projected subgradient minimization versus superiorization (Q2251567) (← links)
- The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle (Q2252928) (← links)
- Strong convergence theorems for common solutions of a family of nonexpansive mappings and an accretive operator (Q2253253) (← links)
- Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures (Q2260660) (← links)
- Bregman proximal mappings and Bregman-Moreau envelopes under relative prox-regularity (Q2302825) (← links)
- Optimization models for reaction networks: information divergence, quadratic programming and Kirchhoff's laws (Q2345039) (← links)
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods (Q2346394) (← links)
- On the finite convergence of a projected cutter method (Q2349845) (← links)
- Constraining by a family of strictly nonexpansive idempotent functions with applications in image reconstruction (Q2376863) (← links)
- Improved constraint consensus methods for seeking feasibility in nonlinear programs (Q2377177) (← links)
- Convergence rates for Kaczmarz-type algorithms (Q2413487) (← links)
- Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems (Q2423796) (← links)
- Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces (Q2427283) (← links)
- How good are projection methods for convex feasibility problems? (Q2427393) (← links)
- On the incomplete oblique projections method for solving box constrained least squares problems (Q2453469) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- Improving solver success in reaching feasibility for sets of nonlinear constraints (Q2459379) (← links)
- Asset and liability modelling for participating policies with guarantees (Q2462133) (← links)
- Incomplete oblique projections for solving large inconsistent linear systems (Q2467156) (← links)
- Iterative approximation to convex feasibility problems in Banach space (Q2472281) (← links)
- A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy (Q2472373) (← links)
- Optimal control model for radiation therapy inverse planning applying the Boltzmann transport equation (Q2472375) (← links)
- Incomplete alternating projection method for large inconsistent linear systems (Q2472379) (← links)
- On linear infeasibility arising in intensity-modulated radiation therapy inverse planning (Q2472384) (← links)
- The application of an oblique-projected Landweber method to a model of supervised learning (Q2473156) (← links)
- Convergent Lagrangian heuristics for nonlinear minimum cost network flows (Q2480971) (← links)
- Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces (Q2491413) (← links)
- Extrapolation algorithm for affine-convex feasibility problems (Q2494384) (← links)
- Computational acceleration of projection algorithms for the linear best approximation problem (Q2497243) (← links)
- The distance between two convex sets (Q2497250) (← links)
- New class of multiplicative algorithms for solving of entropy-linear programs (Q2503213) (← links)
- Twenty years of linear programming based portfolio optimization (Q2514724) (← links)
- Algorithms for the quasiconvex feasibility problem (Q2570027) (← links)
- A hybrid Kaczmarz-conjugate gradient algorithm for image reconstruction (Q2638337) (← links)
- On coupled Boltzmann transport equation related to radiation therapy (Q2642153) (← links)
