Parallel Majorization Minimization with Dynamically Restricted Domains for Nonconvex Optimization
Publication
, Conference
Kaganovsky, Y; Odinaka, I; Carlson, D; Carin, L
Published in: Artificial Intelligence and Statistics
2016
Duke Scholars
Published In
Artificial Intelligence and Statistics
Publication Date
2016
Start / End Page
1497 / 1505
Citation
APA
Chicago
ICMJE
MLA
NLM
Kaganovsky, Y., Odinaka, I., Carlson, D., & Carin, L. (2016). Parallel Majorization Minimization with Dynamically Restricted Domains for Nonconvex Optimization. In Artificial Intelligence and Statistics (pp. 1497–1505).
Kaganovsky, Yan, Ikenna Odinaka, David Carlson, and Lawrence Carin. “Parallel Majorization Minimization with Dynamically Restricted Domains for Nonconvex Optimization.” In Artificial Intelligence and Statistics, 1497–1505, 2016.
Kaganovsky Y, Odinaka I, Carlson D, Carin L. Parallel Majorization Minimization with Dynamically Restricted Domains for Nonconvex Optimization. In: Artificial Intelligence and Statistics. 2016. p. 1497–505.
Kaganovsky, Yan, et al. “Parallel Majorization Minimization with Dynamically Restricted Domains for Nonconvex Optimization.” Artificial Intelligence and Statistics, 2016, pp. 1497–505.
Kaganovsky Y, Odinaka I, Carlson D, Carin L. Parallel Majorization Minimization with Dynamically Restricted Domains for Nonconvex Optimization. Artificial Intelligence and Statistics. 2016. p. 1497–1505.
Published In
Artificial Intelligence and Statistics
Publication Date
2016
Start / End Page
1497 / 1505