Set intersection problems: supporting hyperplanes and quadratic programming

DOI10.1007/s10107-014-0759-zzbMath1311.90144arXiv1212.6843MaRDI QIDQ2515044

Chin How Jeffrey Pang

Publication date: 9 February 2015

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.6843

zbMATH Keywords

quadratic programming; superlinear convergence; alternating projections; Dykstra's algorithm; supporting hyperplanes; best approximation problem

Mathematics Subject Classification ID

90C30: Nonlinear programming

65K10: Numerical optimization and variational techniques

49J53: Set-valued and variational analysis

47J25: Iterative procedures involving nonlinear operators

90C59: Approximation methods and heuristics in mathematical programming

46C05: Hilbert and pre-Hilbert spaces: geometry and topology (including spaces with semidefinite inner product)

41A50: Best approximation, Chebyshev systems

41A65: Abstract approximation theory (approximation in normed linear spaces and other abstract spaces)

47A50: Equations and inequalities involving linear operators, with vector unknowns

52A20: Convex sets in (n) dimensions (including convex hypersurfaces)

47A46: Chains (nests) of projections or of invariant subspaces, integrals along chains, etc.

Related Items

Primal-Dual Stochastic Gradient Method for Convex Programs with Many Functional Constraints, The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem, An acceleration scheme for Dykstra's algorithm, Convergence Rate Analysis of a Dykstra-Type Projection Algorithm, A generalized projection-based scheme for solving convex constrained optimization problems, Algorithms for projecting a point onto a level surface of a continuous function on a compact set, Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems, Finitely convergent iterative methods with overrelaxations revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Local linear convergence for alternating and averaged nonconvex projections
• A successive projection method
• Acceleration schemes for the method of alternating projections
• A superlinearly convergent projection algorithm for solving the convex inequality problem
• On the convergence of von Neumann's alternating projection algorithm for two sets
• Block-iterative surrogate projection methods for convex feasibility problems
• Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.
• Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
• Regularities and their relations to error bounds
• An alternating projection that does not converge in norm
• Techniques of variational analysis
• Extrapolation algorithm for affine-convex feasibility problems
• About regularity of collections of sets
• Opial-Type Theorems and the Common Fixed Point Problem
• An Algorithm for Restricted Least Squares Regression
• Decomposition through formalization in a product space
• Variational Analysis
• Accelerating the convergence of the method of alternating projections
• Metric regularity and subdifferential calculus
• On Projection Algorithms for Solving Convex Feasibility Problems
• Convex Analysis
• The method of projections for finding the common point of convex sets
• Best approximation in inner product spaces
• Metric inequality, subdifferential calculus and applications