Fast Algorithms for Projection on an Ellipsoid
From MaRDI portal
Recommendations
- Comparison of several fast algorithms for projection onto an ellipsoid
- Algorithms of projection of a point onto an ellipsoid
- A Class of Methods for Projection on the Intersection of Several Ellipsoids
- Two fast algorithms for projecting a point onto the canonical simplex
- A O(n) algorithm for projecting a vector on the intersection of a hyperplane and R^n_+
Cited in
(22)- Ball-relaxed projection algorithms for multiple-sets split feasibility problem
- Point-to-ellipse and point-to-ellipsoid distance equation analysis
- Alternating projection method for a class of tensor equations
- A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors.
- Measuring the criticality of a Hopf bifurcation
- Linear approximation method for solving split inverse problems and its applications
- Projecting a point onto an ellipsoid
- Residual algorithm for large-scale positive definite generalized eigenvalue problems
- Convergence study on strictly contractive peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms
- Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets
- Algorithms of projection of a point onto an ellipsoid
- Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
- Globally convergent DC trust-region methods
- An extended inertial Halpern-type ball-relaxed \(CQ\) algorithm for multiple-sets split feasibility problem
- Some novel inertial ball-relaxed CQ algorithms for solving the split feasibility problem with multiple output sets
- A sequential subspace projection method for linear symmetric eigenvalue problem
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
- A Class of Methods for Projection on the Intersection of Several Ellipsoids
- The convergence properties of infeasible inexact proximal alternating linearized minimization
- Comparison of several fast algorithms for projection onto an ellipsoid
- Randomized heuristic algorithms for orthogonal projection of a point onto a set
- The ball-relaxed CQ algorithms for the split feasibility problem
This page was built for publication: Fast Algorithms for Projection on an Ellipsoid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470228)
