Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems.
Robert HesseD. Russell LukePublished in: SIAM J. Optim. (2013)
Keyphrases
- optimization problems
- iterative algorithms
- quadratic optimization problems
- test problems
- problems in computer vision
- related problems
- difficult problems
- practical problems
- stochastic shortest path
- convergence rate
- computational complexity
- orders of magnitude
- data structure
- computationally efficient
- combinatorial optimization
- approximate solutions
- computational geometry
- run times
- significant improvement
- evolutionary algorithm
- globally convergent
- bilevel programming
- convex optimization problems
- stochastic approximation
- specific problems
- search methods
- np complete
- partial solutions
- optimization methods