The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem
From MaRDI portal
Publication:5506687
DOI10.1137/16M106090XzbMath1355.41021arXiv1601.01174OpenAlexW2962739316MaRDI QIDQ5506687
Publication date: 13 December 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.01174
Hilbert spaceconvergence ratebest approximationDykstra's algorithmalternating minimizationquadratic programming strategysupporting halfspace
Related Items
Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting ⋮ Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Anderson acceleration of the alternating projections method for computing the nearest correlation matrix
- Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- On the convergence properties of Hildreth's quadratic programming algorithm
- A cyclic projection algorithm via duality
- On the convergence of Han's method for convex programming with quadratic objective
- A successive projection method
- Acceleration schemes for the method of alternating projections
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Introductory lectures on convex optimization. A basic course.
- Extrapolation algorithm for affine-convex feasibility problems
- About regularity of collections of sets
- Set intersection problems: supporting hyperplanes and quadratic programming
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes
- Unconstrained Optimization Techniques for the Acceleration of Alternating Projection Methods
- An Algorithm for Restricted Least Squares Regression
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- Accelerated, Parallel, and Proximal Coordinate Descent
- Decomposition through formalization in a product space
- Globally convergent block-coordinate techniques for unconstrained optimization
- The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
- Variational Analysis
- Accelerating the convergence of the method of alternating projections
- A Dual Approach to Semidefinite Least-Squares Problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
- On the Convergence of Block Coordinate Descent Type Methods
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- The method of projections for finding the common point of convex sets
- Convex analysis and monotone operator theory in Hilbert spaces
- Best approximation in inner product spaces
- An acceleration scheme for Dykstra's algorithm
