[ACM Press the 2019 ACM SIGSAC Conference - London, United Kingdom (2019.11.11-2019.11.15)] Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS '19 - Peeves
- 作者Birnbach, Simon; Eberz, Simon; Martinovic, Ivan
- 文件大小44122.92KB
- 发表时间2019
- DOI10.1145/3319535.3354254
- 页码1455-1467
A Riemannian Gradient Sampling Algorithm for Nonsmooth Optimization on ManifoldsHosseini, Seyedehsomayeh; Uschmajew, André · SIAM Journal on Optimization · 2017
[International Series of Numerical Mathematics] Nonsmooth Optimization and Its Applications Volume 170 || Tangent and Normal Cones for Low-Rank MatricesHosseini, Seyedehsomayeh; Mordukhovich, Boris S.; Uschmajew, André · 2019
[International Series of Numerical Mathematics] Nonsmooth Optimization and Its Applications Volume 170 || Subdifferential Enlargements and Continuity Properties of the V U $$mathcal { {VU}}$$ -Decomposition in Convex OptimizationHosseini, Seyedehsomayeh; Mordukhovich, Boris S.; Uschmajew, André · 2019
Pathwise Stochastic Optimal ControlRogers, L. C. G. · SIAM Journal on Control and Optimization · 2007
Random Convex ProgramsCalafiore, Giuseppe Carlo · SIAM Journal on Optimization · 2010
The Proximal Average: Basic TheoryBauschke, Heinz H.; Goebel, Rafal; Lucet, Yves; Wang, Xianfu · SIAM Journal on Optimization · 2008
Multivariable Utility FunctionsChiarolla, Maria B.; Haussmann, Ulrich G. · SIAM Journal on Optimization · 2009
MPCC: Critical Point TheoryJongen, H. Th.; Rückmann, Jan.-J.; Shikhman, V. · SIAM Journal on Optimization · 2009
Algebraic Degree of Polynomial OptimizationNie, Jiawang; Ranestad, Kristian · SIAM Journal on Optimization · 2009
Error Bounds for Convex PolynomialsYang, W. H. · SIAM Journal on Optimization · 2009
Feasibility of Integer KnapsacksAliev, Iskander; Henk, Martin · SIAM Journal on Optimization · 2010