Fast Algorithms for Projection on an Ellipsoid
From MaRDI portal
Publication:5470228
DOI10.1137/040613305zbMath1105.65064OpenAlexW2050999345MaRDI QIDQ5470228
Publication date: 30 May 2006
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/040613305
numerical exampleslinear convergencelarge-scale convex programmingprojection algorithmsinside ball algorithmLin-Han algorithmprojection on ellipsoid
Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06)
Related Items (18)
Alternating projection method for a class of tensor equations ⋮ Ball-relaxed projection algorithms for multiple-sets split feasibility problem ⋮ An extended inertial Halpern-type ball-relaxed \(CQ\) algorithm for multiple-sets split feasibility problem ⋮ Linear approximation method for solving split inverse problems and its applications ⋮ Point-to-ellipse and point-to-ellipsoid distance equation analysis ⋮ Randomized heuristic algorithms for orthogonal projection of a point onto a set ⋮ A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs ⋮ A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors ⋮ The convergence properties of infeasible inexact proximal alternating linearized minimization ⋮ Measuring the criticality of a Hopf bifurcation ⋮ The ball-relaxed CQ algorithms for the split feasibility problem ⋮ Comparison of several fast algorithms for projection onto an ellipsoid ⋮ Globally convergent DC trust-region methods ⋮ 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 ⋮ A SEQUENTIAL SUBSPACE PROJECTION METHOD FOR LINEAR SYMMETRIC EIGENVALUE PROBLEM ⋮ Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
This page was built for publication: Fast Algorithms for Projection on an Ellipsoid
