The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
From MaRDI portal
Publication:4302536
DOI10.1080/01630569408816580zbMath0807.41019OpenAlexW2047043241MaRDI QIDQ4302536
Publication date: 2 March 1995
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630569408816580
linear programmingquadratic programmingconvex regressionHildreth's algorithmisotone regressionDykstra's cyclic projections algorithm
Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
Related Items
Generalized isotone projection cones, A new mapping for finding common solutions of equilibrium problems and fixed point problems of finite family of nonexpansive mappings, Unnamed Item, New iterative scheme with nonexpansive mappings for equilibrium problems and variational inequality problems in Hilbert spaces, Strong convergence of a general iterative algorithm for equilibrium problems and variational inequality problems, A general iterative method for a finite family of nonexpansive mappings, Strong and weak convergence theorems for an infinite family of nonexpansive mappings and applications, A splitting method for finding the resolvent of the sum of two maximal monotone operators, Some results on an infinite family of nonexpansive mappings and an inverse-strongly monotone mapping in Hilbert spaces, How good are projection methods for convex feasibility problems?, An iterative method for finding common solutions of equilibrium and fixed point problems, Convergence Rate Analysis of a Dykstra-Type Projection Algorithm, Estimation of Monge matrices, Accelerated alternating descent methods for Dykstra-like problems, Statistical multiresolution Dantzig estimation in imaging: fundamental concepts and algorithmic framework, Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces., Actuarial Risk Matrices: The Nearest Positive Semidefinite Matrix Problem, Dykstras algorithm with bregman projections: A convergence proof, An implicit method for finding common solutions of variational inequalities and systems of equilibrium problems and fixed points of infinite family of nonexpansive mappings, Solving stochastic convex feasibility problems in hilbert spaces, Strong convergence of a general iterative method for variational inequality problems and fixed point problems in Hilbert spaces, A general iterative method for an infinite family of nonexpansive mappings, Strong convergence of a modified iterative algorithm for mixed-equilibrium problems in Hilbert spaces, Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings, Quadratic optimization of fixed points of nonexpansive mappings in hubert space, Strong convergence of shrinking projection methods for quasi-nonexpansive mappings and equilibrium problems, How to project onto an isotone projection cone, Equivalent theorems of the convergence between Ishikawa-Halpern iteration and viscosity approximation method, Strong convergence for a minimization problem on points of equilibrium and common fixed points of an infinite family of nonexpansive mappings, Strong convergence of the modified Ishikawa iterative method for infinitely many nonexpansive mappings in Banach spaces, Computational acceleration of projection algorithms for the linear best approximation problem, Stochastic approximation on Riemannian manifolds, Accelerating the convergence of the method of alternating projections, A GENERAL ITERATIVE ALGORITHM FOR EQUILIBRIUM PROBLEMS AND VARIATIONAL INEQUALITY PROBLEMS IN A HILBERT SPACE, An acceleration scheme for Dykstra's algorithm, A semi-smooth Newton method for a special piecewise linear system with application to positively constrained convex quadratic programming, Unnamed Item, Successive approximate algorithm for best approximation from a polyhedron, Some results on non-expansive mappings and relaxed cocoercive mappings in Hilbert spaces, Strong convergence theorems for an infinite family of nonexpansive mappings in Banach spaces, Estimation of the convergence rate of Dykstra's cyclic projections algorithm in polyhedral case, Strong convergence theorems by hybrid methods for a finite family of nonexpansive mappings and inverse-strongly monotone mappings, Convergence of a hybrid projection algorithm in Banach spaces, Dykstra's algorithm with strategies for projecting onto certain polyhedral cones, The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem, Projection onto simplicial cones by a semi-smooth Newton method, Projection onto simplicial cones by Picard's method, Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems
Cites Work
- On the convergence properties of Hildreth's quadratic programming algorithm
- Error bounds for the method of alternating projections
- A cyclic projection algorithm via duality
- On the convergence of Han's method for convex programming with quadratic objective
- A successive projection method
- On the convergence of von Neumann's alternating projection algorithm for two sets
- On the von Neumann alternating algorithm in Hilbert space
- Constrained best approximation in Hilbert space
- An Algorithm for Restricted Least Squares Regression
- Practical and mathematical aspects of the problem of reconstructing objects from radiographs
- Normal solutions of linear programs
- Applications of the Hahn-Banach Theorem in Approximation Theory
- Functional Operators (AM-22), Volume 2
