A splitting bundle approach for non-smooth non-convex minimizationA splitting bundle approach for
non-smooth non-convex minimization
Selective Bi-coordinate Method for Limit Non-Smooth Resource Allocation Type Problems for limit
non-smooth optimization problems, which involve a single linear equality and box constraints. Here
Exact penalties for decomposable convex optimization problems problem is a convex
non-smooth optimization problem. We propose to apply the exact
non-smooth penalty
Decomposition descent method for limit optimization problems© Springer International Publishing AG 2017. We consider a general limit
optimization problem whose
Decomposition descent method for limit optimization problems© Springer International Publishing AG 2017. We consider a general limit
optimization problem whose
Game of Constraints for Evaluation of Guaranteed Composite System Performance resources. The problem suggested to be solved by combined penalty and
non-smooth optimization methods
Estimating smoothness and optimal bandwidth for probability density functions smoothness parameter, the rates of mean square convergence of
optimal (on the bandwidth) density estimators
Necessary optimality conditions without a priori normality assumptions function f: X→R1 (k1 and k2 are given). Considered is
optimization problem: f(x)→min, x∈C, F1(x)≤0, F2(x)=0