Comparison of several fast algorithms for projection onto an ellipsoid

DOI10.1016/J.CAM.2017.01.008zbMATH Open1360.65168OpenAlexW2574471105MaRDI QIDQ515784FDOQ515784

Deren Han, Xing-Ju Cai, Zehui Jia

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

Recommendations

• Fast Algorithms for Projection on an Ellipsoid
• Comparative study of two fast algorithms for projecting a point to the standard simplex
• A Class of Methods for Projection on the Intersection of Several Ellipsoids
• Algorithms of projection of a point onto an ellipsoid
• The alternating direction method of multipliers for finding the distance between ellipsoids

zbMATH Keywords

algorithmalternating direction methodimage reconstructionimage restorationconstrained convex optimizationlinear convergenceDantzig selectorself-adaptiveprojecting 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)

Cites Work

• 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
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• Title not available (Why is that?)
• Solving Constrained Total-variation Image Restoration and Reconstruction Problems via Alternating Direction Methods
• Local Linear Convergence of the Alternating Direction Method of Multipliers on Quadratic or Linear Programs
• A new inexact alternating directions method for monotone variational inequalities
• The Linearized Alternating Direction Method of Multipliers for Dantzig Selector
• Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
• An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
• On the asymptotic behaviour of some new gradient methods
• An alternating direction method for finding Dantzig selectors
• 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
• A Class of Methods for Projection on the Intersection of Several Ellipsoids
• Fast Algorithms for Projection on an Ellipsoid

Cited In (12)

• The alternating direction method of multipliers for finding the distance between ellipsoids
• An Alternating Augmented Lagrangian method for constrained nonconvex optimization
• Alternating projection method for a class of tensor equations
• Convergence study on strictly contractive peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms
• A successive centralized circumcentered-reflection method for the convex feasibility problem
• Algorithms of projection of a point onto an ellipsoid
• A primal-dual algorithm for computing Finsler distances and applications
• Circumcentering approximate reflections for solving the convex feasibility problem
• A Class of Methods for Projection on the Intersection of Several Ellipsoids
• The convergence properties of infeasible inexact proximal alternating linearized minimization
• Title not available (Why is that?)
• On the centralization of the circumcentered-reflection method

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

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