Subgradient projection algorithms for convex feasibility problems in the presence of computational errors.
Alexander J. ZaslavskiPublished in: J. Approx. Theory (2013)
Keyphrases
- cutting plane
- convex optimization
- convex optimization problems
- benchmark problems
- optimization problems
- difficult problems
- test problems
- computational cost
- learning algorithm
- mathematical programming
- np complete
- search methods
- data structure
- related problems
- practical problems
- minimization problems
- approximate solutions
- quadratic optimization problems
- combinatorial optimization
- numerical methods
- convex functions
- problems in computer vision
- optimization procedure
- stationary points
- computationally efficient
- linearly constrained
- significant improvement