An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization.
Adil M. BagirovAsef Nazari GanjehlouPublished in: Math. Methods Oper. Res. (2008)
Keyphrases
- optimization algorithm
- global optimization
- objective function
- optimization method
- cost function
- dynamic programming
- computational complexity
- learning algorithm
- combinatorial optimization
- segmentation algorithm
- expectation maximization
- optimization process
- optimal solution
- worst case
- constrained optimization
- np hard
- optimization procedure
- detection algorithm
- convergence rate
- piecewise linear
- optimization model
- globally convergent
- subgradient method
- particle swarm optimization
- linear programming
- multi objective
- k means
- lower bound
- preprocessing
- image segmentation