A Class of Methods for Projection on the Intersection of Several Ellipsoids

DOI10.1137/S1052623403422297MaRDI QIDQ4651998zbMATH OpenOpenAlexFDO

Authors Anhua Lin, Shih-Ping Han

Publication date 23 February 2005

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s1052623403422297

zbMATH Keywords

optimizationprojectionconvex programmingellipsoid

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Recommendations

• A class of methods for projection on a convex set
• Fast Algorithms for Projection on an Ellipsoid
• Projections onto the intersection of a one-norm ball or sphere and a two-norm ball or sphere
• Algorithms of projection of a point onto an ellipsoid
• Comparison of several fast algorithms for projection onto an ellipsoid

Cited in

(11)

• On the centralization of the circumcentered-reflection method
• A class of methods for projection on a convex set
• Alternating projection method for a class of tensor equations
• An Ellipsoidal Branch and Bound Algorithm for Global Optimization
• A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane
• Projecting a point onto an ellipsoid
• Projections onto the intersection of a one-norm ball or sphere and a two-norm ball or sphere
• Algorithms of projection of a point onto an ellipsoid
• Circumcentering approximate reflections for solving the convex feasibility problem
• Comparison of several fast algorithms for projection onto an ellipsoid
• Fast Algorithms for Projection on an Ellipsoid

This page was built for publication: A Class of Methods for Projection on the Intersection of Several Ellipsoids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4651998)