Reflection-projection method for convex feasibility problems with an obtuse cone
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 686909
- Block-iterative surrogate projection methods for convex feasibility problems
- A log-quadratic projection method for convex feasibility problems
- On projection reflection method in Hilbert spaces
- A finite steps algorithm for solving convex feasibility problems
Cites work
- A method of projection onto an acute cone with level control in convex minimization
- Applications of second-order cone programming
- Barrier Functions in Interior Point Methods
- Best approximation in inner product spaces
- Conic convex programming and self-dual embedding
- Convex Analysis
- Convex analysis and nonlinear optimization. Theory and examples
- Dykstra's alternating projection algorithm for two sets
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Hilbertian convex feasibility problem: Convergence of projection methods
- scientific article; zbMATH DE number 3177945 (Why is no real title available?)
- scientific article; zbMATH DE number 47597 (Why is no real title available?)
- scientific article; zbMATH DE number 3528420 (Why is no real title available?)
- scientific article; zbMATH DE number 3558452 (Why is no real title available?)
- scientific article; zbMATH DE number 3595777 (Why is no real title available?)
- scientific article; zbMATH DE number 686909 (Why is no real title available?)
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- scientific article; zbMATH DE number 1182578 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Matrix algorithms. Vol. 2: Eigensystems
- Matrix Analysis
- Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems
- Obtuse cones and Gram matrices with non-negative inverse
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the asymptotic behavior of some alternate smoothing series expansion iterative methods
- PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS
- Proximity Maps for Convex Sets
- Residual Selection in A Projection Method for Convex Minimization Problems
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Semidefinite Programming
- Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Solving Systems of Linear Inequalities
Cited in
(29)- A new characterization of nonnegativity of Moore-Penrose inverses of Gram operators
- An improved semidefinite programming relaxation for the satisfiability problem
- Method of alternating projections for the general absolute value equation
- Regularization inertial proximal point algorithm for common solutions of a finite family of inverse-strongly monotone equations
- A family of projection gradient methods for solving the multiple-sets split feasibility problem
- On the finite convergence of a projected cutter method
- How good are projection methods for convex feasibility problems?
- On the Mann-type iteration and the convex feasibility problem
- Extrapolation algorithm for affine-convex feasibility problems
- On the circumcentered-reflection method for the convex feasibility problem
- A log-quadratic projection method for convex feasibility problems
- On the finite termination of the Douglas-Rachford method for the convex feasibility problem
- Primal-dual first-order methods for a class of cone programming
- On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces
- Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces
- Accelerated reflection projection algorithm and its application to the LMI problem
- Restricted normal cones and sparsity optimization with affine constraints
- scientific article; zbMATH DE number 686909 (Why is no real title available?)
- A cyclic and simultaneous iterative method for solving the multiple-sets split feasibility problem
- Using Nemirovski's Mirror-Prox method as basic procedure in Chubanov's method for solving homogeneous feasibility problems
- Linear convergence of projection algorithms
- An active-set method for second-order conic-constrained quadratic programming
- On the finite convergence of the Douglas-Rachford algorithm for solving (not necessarily convex) feasibility problems in Euclidean spaces
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- Inradius and circumradius of various convex cones arising in applications
- Asymptotics for some proximal-like method involving inertia and memory aspects
- Global convergence and acceleration of projection methods for feasibility problems involving union convex sets
- Quasioptimal alternating projections and their use in low-rank approximation of matrices and tensors
- Using the Krylov subspace formulation to improve regularisation and interpretation in partial least squares regression
This page was built for publication: Reflection-projection method for convex feasibility problems with an obtuse cone
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q704736)
