Well-Posedness and Primal-Dual Analysis of Some Convex Separable Optimization Problems
Well-Posedness and Primal-Dual Analysis of Some Convex Separable Optimization Problems
We focus on some convex separable optimization problems, considered by the author in previous papers, for which problems, necessary and sufficient conditions or sufficient conditions have been proved, and convergent algorithms of polynomial computational complexity have been proposed for solving these problems. The concepts of well-posedness of optimization problems in …