Solving OSCAR regularization problems by proximal splitting algorithms.
Xiangrong ZengMário A. T. FigueiredoPublished in: CoRR (2013)
Keyphrases
- optimization problems
- combinatorial optimization
- convex optimization problems
- quadratic optimization problems
- computational complexity
- computational cost
- search methods
- benchmark problems
- constraint problems
- solving problems
- difficult problems
- problems in computer vision
- problems in artificial intelligence
- related problems
- computationally efficient
- significant improvement
- global optimization problems
- minimization problems
- np complete problems
- resource constrained project scheduling problem
- solving complex
- approximate solutions
- combinatorial problems
- graph coloring
- exact algorithms
- run times
- bilevel programming
- distributed constraint optimization problems
- worst case
- mixed norm
- partial solutions