Comparison of several fast algorithms for projection onto an ellipsoid

DOI10.1016/j.cam.2017.01.008zbMath1360.65168OpenAlexW2574471105MaRDI QIDQ515784

Deren Han, Zehui Jia, Xing-Ju Cai

Publication date: 16 March 2017

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2017.01.008

zbMATH Keywords

algorithmlinear convergenceimage reconstructionalternating direction methodimage restorationconstrained convex optimizationself-adaptiveDantzig selectorprojecting onto ellipsoids

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (8)

Alternating projection method for a class of tensor equations ⋮ Circumcentering approximate reflections for solving the convex feasibility problem ⋮ The convergence properties of infeasible inexact proximal alternating linearized minimization ⋮ On the centralization of the circumcentered-reflection method ⋮ A successive centralized circumcentered-reflection method for the convex feasibility problem ⋮ An Alternating Augmented Lagrangian method for constrained nonconvex optimization ⋮ The alternating direction method of multipliers for finding the distance between ellipsoids ⋮ Convergence study on strictly contractive peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms

Cites Work

• Unnamed Item
• An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
• A new inexact alternating directions method for monotone variational inequalities
• An alternating direction method for finding Dantzig selectors
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• On the asymptotic behaviour of some new gradient methods
• A simple self-adaptive alternating direction method for linear variational inequality problems
• Linear Convergence of the Alternating Direction Method of Multipliers for a Class of Convex Optimization Problems
• Solving Constrained Total-variation Image Restoration and Reconstruction Problems via Alternating Direction Methods
• A Class of Methods for Projection on the Intersection of Several Ellipsoids
• The Linearized Alternating Direction Method of Multipliers for Dantzig Selector
• Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
• Local Linear Convergence of the Alternating Direction Method of Multipliers on Quadratic or Linear Programs
• Fast Algorithms for Projection on an Ellipsoid

This page was built for publication: Comparison of several fast algorithms for projection onto an ellipsoid