A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization.
Xiaoliang WangLi-Ping PangXiantao XiaoPublished in: J. Comput. Appl. Math. (2023)
Keyphrases
- optimization algorithm
- objective function
- optimization method
- cost function
- improved algorithm
- optimization process
- dynamic programming
- computational cost
- clustering method
- high accuracy
- preprocessing
- computational complexity
- significant improvement
- globally convergent
- selection algorithm
- optimization strategy
- detection algorithm
- combinatorial optimization
- search strategy
- matching algorithm
- optimization model
- segmentation algorithm
- optimization problems
- probabilistic model
- newton method
- learning algorithm
- optimization strategies
- energy function
- segmentation method
- optimization criteria
- penalty function
- k means
- constrained optimization
- optimization procedure
- evolution strategy
- convergence analysis
- evolutionary strategy
- regularized least squares
- quadratic programming
- convergence rate
- regularization term
- recognition algorithm
- simulated annealing
- variational inequalities
- mathematical programming
- global convergence
- convex optimization
- genetic algorithm
- global optimization
- linear programming
- line search
- saddle point
- optimal solution
- similarity measure
- concave convex procedure