An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence.
Renato D. C. MonteiroIlan AdlerPublished in: Math. Oper. Res. (1990)
Keyphrases
- iterative algorithms
- linear systems
- learning algorithm
- piecewise linear
- dynamic programming
- detection algorithm
- cost function
- np hard
- globally optimal
- benchmark problems
- semidefinite programming
- np hard problems
- search space
- optimal solution
- linear complexity
- convergence property
- quadratic programming
- convex quadratic programming
- quadratic optimization problems
- convergence rate
- particle swarm optimization
- k means
- objective function
- combinatorial optimization
- simulated annealing
- global minima
- multi class classification
- expectation maximization
- stationary points
- worst case
- boolean expressions
- number of iterations required
- evolutionary algorithm