Abstract
AbstractFor a random variable, superdistribution has emerged as a valuable probability concept. Similar to cumulative distribution function (CDF), it uniquely defines the random variable and can be evaluated with a simple one-dimensional minimization formula. This work leverages the structure of that formula to introduce buffered CDF (bCDF) and reduced CDF (rCDF) for random vectors. bCDF and rCDF are shown to be the minimal Schur-convex upper bound and the maximal Schur-concave lower bound of the multivariate CDF, respectively. Special structure of bCDF and rCDF is used to construct an algorithm for solving optimization problems with bCDF and rCDF in objective or constraints. The efficiency of the algorithm is demonstrated in a case study on optimization of a collateralized debt obligation with bCDF functions in constraints.
Publisher
Springer Science and Business Media LLC
Subject
Control and Optimization,Business, Management and Accounting (miscellaneous)
Reference18 articles.
1. Bertsekas, D.: Nonlinear programming. J. Oper. Res. Soc. 48(3), 334 (1997)
2. Grechuk, B., Molyboha, A., Zabarankin, M.: Chebyshev’s inequalities with law invariant deviation measures. Probab. Eng. Inf. Sci. 24, 145–170 (2010)
3. Grippof, L., Sciandrone, M.: Globally convergent block-coordinate techniques for unconstrained optimization. Optim. Methods Softw. 10(4), 587–637 (1999)
4. Grippof, L., Sciandrone, M.: On the convergence of the block nonlinear Gauss-Seidel method under convex constraints. Oper. Res. Lett. 26(3), 127–136 (2000)
5. Lyu, H.: Convergence and complexity of block coordinate descent with diminishing radius for nonconvex optimization, arXiv:2012.03503 (2020)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献