Pages that link to "Item:Q2515044"
From MaRDI portal
The following pages link to Set intersection problems: supporting hyperplanes and quadratic programming (Q2515044):
Displaying 12 items.
- A simple algorithm for computing projection onto intersection of finite level sets (Q260148) (← links)
- A generalized projection-based scheme for solving convex constrained optimization problems (Q721952) (← links)
- Algorithms for projecting a point onto a level surface of a continuous function on a compact set (Q889159) (← links)
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. (Q1421503) (← links)
- The support-vector algorithm with compound step (Q1915680) (← links)
- Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems (Q2149580) (← links)
- Finitely convergent iterative methods with overrelaxations revisited (Q2239369) (← links)
- On the application of alternating projection under the constraint of linear matrix inequalities (Q4237960) (← links)
- Primal-Dual Stochastic Gradient Method for Convex Programs with Many Functional Constraints (Q5114401) (← links)
- The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem (Q5506687) (← links)
- An acceleration scheme for Dykstra's algorithm (Q5963308) (← links)
- Convergence Rate Analysis of a Dykstra-Type Projection Algorithm (Q6202756) (← links)
