Pages that link to "Item:Q5381120"
From MaRDI portal
The following pages link to Proximal Distance Algorithms: Theory and Examples (Q5381120):
Displaying 15 items.
- Distance majorization and its applications (Q403660) (← links)
- Algorithms for computing the optimal transitive approximation of a proximity relation (Q422457) (← links)
- Calculation of the Prokhorov distance by optimal quantization and maximum flow (Q734428) (← links)
- Finding best approximation pairs for two intersections of closed convex sets (Q2070342) (← links)
- A penalized method of alternating projections for weighted low-rank Hankel matrix optimization (Q2088963) (← links)
- High-performance statistical computing in the computing environments of the 2020s (Q2092893) (← links)
- Random minibatch subgradient algorithms for convex problems with functional constraints (Q2338088) (← links)
- Perspective functions: proximal calculus and applications in high-dimensional statistics (Q2408636) (← links)
- A proximal algorithm with quasi distance. Application to habit's formation (Q3145052) (← links)
- The Emperor Has No Caps! A Comparison of DCJ and Algebraic Distances (Q4992760) (← links)
- (Q5095420) (← links)
- Dimension Reduction for Integrative Survival Analysis (Q6055731) (← links)
- A Legacy of EM Algorithms (Q6067612) (← links)
- A Sharper Computational Tool for Regression (Q6631118) (← links)
- The stochastic proximal distance algorithm (Q6657820) (← links)
