Robust Stopping Criteria for Dykstra's Algorithm
From MaRDI portal
Publication:5318308
DOI10.1137/03060062XzbMath1149.90382OpenAlexW2018711500MaRDI QIDQ5318308
Marcos Raydan, Ernesto G. Birgin
Publication date: 22 September 2005
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/03060062x
Related Items
Model-Based Derivative-Free Methods for Convex-Constrained Optimization, An iteration method to solve multiple constrained least squares problems, Anderson acceleration of the alternating projections method for computing the nearest correlation matrix, Decomposition Methods for Sparse Matrix Nearness Problems, DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS, A low-cost alternating projection approach for a continuous formulation of convex and cardinality constrained optimization, Lower bounds for ground states of condensed matter systems, Dykstra's algorithm for constrained least-squares doubly symmetric matrix problems, Computational acceleration of projection algorithms for the linear best approximation problem, An acceleration scheme for Dykstra's algorithm, Least-squares estimation of two-ordered monotone regression curves, On the inexact scaled gradient projection method, Metric-Constrained Optimization for Graph Clustering Algorithms
