Pages that link to "Item:Q5318308"
From MaRDI portal
The following pages link to Robust Stopping Criteria for Dykstra's Algorithm (Q5318308):
Displaying 14 items.
- Anderson acceleration of the alternating projections method for computing the nearest correlation matrix (Q306368) (← links)
- Dykstra's algorithm for constrained least-squares doubly symmetric matrix problems (Q982653) (← links)
- On the inexact scaled gradient projection method (Q2070333) (← links)
- Computational acceleration of projection algorithms for the linear best approximation problem (Q2497243) (← links)
- An iteration method to solve multiple constrained least squares problems (Q2628358) (← links)
- DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS (Q2925693) (← links)
- Least-squares estimation of two-ordered monotone regression curves (Q3068118) (← links)
- Decomposition Methods for Sparse Matrix Nearness Problems (Q3456880) (← links)
- Metric-Constrained Optimization for Graph Clustering Algorithms (Q5025762) (← links)
- Model-Based Derivative-Free Methods for Convex-Constrained Optimization (Q5043286) (← links)
- Lower bounds for ground states of condensed matter systems (Q5137616) (← links)
- An acceleration scheme for Dykstra's algorithm (Q5963308) (← links)
- A low-cost alternating projection approach for a continuous formulation of convex and cardinality constrained optimization (Q6063782) (← links)
- Distributed accelerated gradient methods with restart under quadratic growth condition (Q6607027) (← links)
