Dynamical aspects of some convex acceleration methods as purely iterative algorithm for Newton's maps.
Gerardo HonoratoSergio PlazaPublished in: Appl. Math. Comput. (2015)
Keyphrases
- computational cost
- preprocessing
- significant improvement
- synthetic and real datasets
- dynamic programming
- particle swarm optimization
- heuristic methods
- cost function
- convex hull
- synthetic and real images
- iterative algorithms
- convergence analysis
- similarity measure
- gauss newton
- learning algorithm
- globally optimal
- synthetic datasets
- computationally intensive
- quadratic optimization problems
- optimization algorithm
- segmentation algorithm
- expectation maximization
- np hard
- computational complexity
- classification method
- spectral clustering
- linear programming
- probabilistic model
- k means
- theoretical guarantees
- objective function
- efficient optimization
- decision trees
- newton raphson
- neural network