SHDQP: An algorithm for convex set intersection problems based on supporting hyperplanes and dual quadratic programming
Explore this paper's citation graph
Summary
It turns out that the dual quadratic programming algorithm of Goldfarb and Idnani is particular suited for projecting onto the polyhedra generated, because it solves the Quadratic programs from warm start solutions whenever new constraints are added.
- Type
- preprint
- Published
- 2013-06-29
- Cited by
- 3
- References
- 32
- Access
- Open access
- OpenAlex
- https://openalex.org/W69763842
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:115702149
Keywords
Quadratic programming, Intersection (aeronautics), Hyperplane, Polyhedron, Projection (relational algebra)
References
- Convex Analysis and Monotone Operator Theory in Hilbert Spaces
- Alternating Projection Methods
- A parallel subgradient projections method for the convex feasibility problem
- Algebraic reconstruction techniques (ART) for three-dimensional electron microscopy and x-ray photography.
- Acceleration schemes for the method of alternating projections
- On the numerical solution of heat conduction problems in two and three space variables
- Set intersection problems: supporting hyperplanes and quadratic programming
- Accelerating the convergence of the method of alternating projections
- A successive projection method
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- On Projection Algorithms for Solving Convex Feasibility Problems
- About Regularity of Collections of Sets
- An Algorithm for Restricted Least Squares Regression
- A superlinearly convergent projection algorithm for solving the convex inequality problem
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Extrapolation algorithm for affine-convex feasibility problems
- Unconstrained Optimization Techniques for the Acceleration of Alternating Projection Methods
- A fast algorithm for solving a linear feasibility problem with application to Intensity-Modulated Radiation Therapy.
- A relaxation method for reconstructing objects from noisy X-rays
- Decomposition through formalization in a product space
Cited by
Related papers
- Set intersection problems: Integrating projection and quadratic programming algorithms
- A dual gradient-projection method for large-scale strictly convex quadratic problems
- An approximate projection algorithm for distributed set intersection computation
- A Class of Methods for Projection on a Convex Set
- Algorithm for Projecting Onto Simplicial Cones and Application to Portfolio Optimization
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
- Half-Space Relaxation Projection Method for Solving Multiple-Set Split Feasibility Problem
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Polynomial algorithms for projecting a point onto a region defined by a linearconstraint and box constraints in ℝn