An Acceleration Scheme for Solving Convex Feasibility Problems Using Incomplete Projection Algorithms.
Nélida E. EchebestM. T. GuardarucciHugo D. ScolnikM. C. VacchinoPublished in: Numer. Algorithms (2004)
Keyphrases
- convex optimization problems
- quadratic optimization problems
- convex optimization
- optimization problems
- combinatorial optimization
- benchmark problems
- np complete problems
- problems in artificial intelligence
- convex programming
- constrained problems
- partial solutions
- linearly constrained
- quadratic program
- approximation schemes
- convex sets
- stochastic shortest path
- solving problems
- problems in computer vision
- computational geometry
- search heuristics
- discrete optimization
- combinatorial problems
- missing values
- np complete
- multicommodity flow problems
- distributed constraint optimization problems
- minimization problems
- search algorithm
- resource constrained project scheduling problem
- convex relaxation
- convex functions
- variational inequalities
- quadratic programming
- low rank
- noisy data
- metaheuristic
- worst case