The method of projections for finding the common point of convex sets
From MaRDI portal
Publication:5597971
Cited in
(only showing first 100 items - show all)- A generalized projection-based scheme for solving convex constrained optimization problems
- Optimal \(H_ \infty\) model reduction via linear matrix inequalities: continuous- and discrete-time cases
- Projection methods: an annotated bibliography of books and reviews
- Generalized pole placement via static output feedback: a methodology based on projections
- Decomposition through formalization in a product space
- String-averaging algorithms for convex feasibility with infinitely many sets
- Alternating projection method for intersection of convex sets, multi-agent consensus algorithms, and averaging inequalities
- About subtransversality of collections of sets
- A simple algorithm for computing projection onto intersection of finite level sets
- A sequential iteration algorithm with non-monotoneous behaviour in the method of projections onto convex sets
- Robustness analysis of discrete time-delay systems
- Closed-Form Expressions for Projectors onto Polyhedral Sets in Hilbert Spaces
- A finite steps algorithm for solving convex feasibility problems
- Multi-dimensional summation-by-parts operators for general function spaces: theory and construction
- Distributed constrained stochastic subgradient algorithms based on random projection and asynchronous broadcast over networks
- A scratch covering algorithm using affine projection method
- A counterexample to De Pierro's conjecture on the convergence of under-relaxed cyclic projections
- New POCS algorithms for regularization of inverse problems
- Row-Oriented Decomposition in Large-Scale Linear Optimization
- Cyclic subgradient projections
- Envelope functions: unifications and further properties
- New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization
- A class of optimized row projection methods for solving large nonsymmetric linear systems
- Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization
- Cyclic projection methods on a class of nonconvex sets
- Improved transmission design algorithms by utilizing variable-strength projections
- New iterative methods for linear inequalities
- Generalized alternating projections on manifolds and convex sets
- New methods for linear inequalities
- Iteration process for fixed point problems and zeros of maximal monotone operators
- A multiprojection algorithm using Bregman projections in a product space
- An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems
- Metric regularity -- a survey. II: Applications
- An acceleration scheme for cyclic subgradient projections method
- On the relationship between the Kurdyka-Łojasiewicz property and error bounds on Hadamard manifolds
- Distributed continuous-time approximate projection protocols for shortest distance optimization problems
- Distributed discrete-time convex optimization with nonidentical local constraints over time-varying unbalanced directed graphs
- Local linear convergence of alternating projections in metric spaces with bounded curvature
- Restricted normal cones and the method of alternating projections: applications
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- A superlinearly convergent projection algorithm for solving the convex inequality problem
- Iterative methods for the computation of fixed points of demicontractive mappings
- On the regularity condition in a convex feasibility problem
- Convergence rate analysis for averaged fixed point iterations in common fixed point problems
- On the convergence of von Neumann's alternating projection algorithm for two sets
- On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space
- Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
- About intrinsic transversality of pairs of sets
- On finitely convergent iterative methods for the convex feasibility problem
- A new algorithm for the minimax location problem with the closest distance
- Low-order control design for LMI problems using alternating projection methods
- A projection method for semidefinite linear systems and its applications
- Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces
- Block-iterative methods for consistent and inconsistent linear equations
- Structure-preserving function approximation via convex optimization
- Alternating convex projection methods for discrete-time covariance control design
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
- Finitely convergent iterative methods with overrelaxations revisited
- The method of successive orthogonal projections for solving nonlinear simultaneous equations
- The combination projection method for solving convex feasibility problems
- Randomized projection methods for convex feasibility: conditioning and convergence rates
- Local linear convergence for alternating and averaged nonconvex projections
- A projection scheme to stability analysis of discrete T-S fuzzy models.
- Stability analysis of discrete singular fuzzy systems
- Phase retrieval via matrix completion
- The geometry of monotone operator splitting methods
- Method of successive projections for finding a common point of sets in metric spaces
- Alternating projections, remotest projections, and greedy approximation
- The asymptotic behavior of the composition of two resolvents
- Extrapolation and local acceleration of an iterative process for common fixed point problems
- Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates
- A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin
- A parallel projection method based on sequential most remote set in convex feasibility problems
- The supporting halfspace-quadratic programming strategy for the dual of the best approximation problem
- Incremental proximal methods for large scale convex optimization
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Iterative algorithm for solving a class of convex feasibility problem
- An alternating projection that does not converge in norm
- Distributed solutions for loosely coupled feasibility problems using proximal splitting methods
- Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings
- Relaxed outer projections, weighted averages and convex feasibility
- Exact convergence rates of alternating projections for nontransversal intersections
- Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces
- Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
- Specific stability region analysis for uncertain fuzzy descriptor systems with multiple derivative matrices
- Stochastic first-order methods with random constraint projection
- Summed squared distance error reduction by simultaneous multiprojections and applications
- A cyclic projection algorithm via duality
- On the convergence of Han's method for convex programming with quadratic objective
- Convergence results for an accelerated nonlinear Cimmino algorithm
- A parallel subgradient projections method for the convex feasibility problem
- A family of projection gradient methods for solving the multiple-sets split feasibility problem
- Solution of projection problems over polytopes
- Incorporation of a priori moment information into signal recovery and synthesis problems
- Weak and norm convergence of a parallel projection method in Hilbert spaces
- Strong convergence of a self-adaptive method for the split feasibility problem
- Piecewise linear retractions by reflexion
- A complex projection scheme and applications
- An acceleration scheme for Dykstra's algorithm
This page was built for publication: The method of projections for finding the common point of convex sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5597971)