{"component":{"type":17,"accent_color":10660273,"components":[{"type":10,"content":"-# WikiRNG · Roll of 10/26/2026 · by [quartzck](https://wikirng.com/u/quartzck)"},{"type":10,"content":"## [Dykstra's projection algorithm](https://wikirng.com/roll/uamMjyKir7)\n*Optimization algorithm*"},{"type":10,"content":">>> Dykstra's algorithm is a method that computes a point in the intersection of convex sets, and is a variant of the alternating projection method (also called the projections onto convex sets method)."},{"type":14,"divider":true,"spacing":1},{"type":10,"content":"### ⬜ Basic · 23,128 SP\n-# Bottom 25%"},{"type":14,"divider":true,"spacing":1},{"type":10,"content":"🟦 🧮 **Equation** · Obscure · +17,511 SP\n-# Has a math formula.\n🟩 ✍️ **Apostrophe** · Notable · +3,118 SP\n-# Title has an apostrophe.\n⬜ 🔬 **Peer Reviewed** · Basic · +700 SP\n-# Cites a journal article.\n⬜ 🪧 **Signposted** · Basic · +590 SP\n-# Has a hatnote.\n⬜ 📕 **Cites a Book** · Basic · +409 SP\n-# Cites a book.\n⬜ 🌱 **Stub-Class** · Basic · +229 SP\n-# Rated Stub by a WikiProject.\n-# +3 more badges"},{"type":14,"divider":true,"spacing":1},{"type":1,"components":[{"type":2,"style":5,"label":"View roll","url":"https://wikirng.com/roll/uamMjyKir7"},{"type":2,"style":5,"label":"Read on Wikipedia","url":"https://en.wikipedia.org/wiki/Dykstra's_projection_algorithm"}]},{"type":10,"content":"-# Article text from Wikipedia, CC BY-SA 4.0"}]}}