A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems.
Gui-Hua LinZhen-Ping YangHaian YinJin ZhangPublished in: Comput. Optim. Appl. (2023)
Keyphrases
- monte carlo
- np hard
- multi class classification
- benchmark problems
- detection algorithm
- globally optimal
- k means
- quadratic optimization problems
- convex functions
- mathematical programming
- search space
- learning algorithm
- optimization problems
- worst case
- expectation maximization
- dynamic programming
- combinatorial optimization
- optimal solution
- primal dual
- genetic algorithm
- approximation schemes
- convex optimization problems
- stochastic approximation
- theoretical guarantees
- semidefinite programming
- image segmentation
- objective function
- approximation algorithms
- convex hull
- probabilistic model
- segmentation algorithm
- np complete
- linear programming