Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis
Published 2019 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis
Authors
Keywords
Nonconvex and nonsmooth optimization, Riemannian manifold, <span class="InlineEquation" id="IEq5">\(\epsilon \), ADMM, Iteration complexity, 90C60, 90C90
Journal
MATHEMATICAL PROGRAMMING
Volume -, Issue -, Pages -
Publisher
Springer Science and Business Media LLC
Online
2019-08-10
DOI
10.1007/s10107-019-01418-8
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Global Convergence of ADMM in Nonconvex Nonsmooth Optimization
- (2018) Yu Wang et al. JOURNAL OF SCIENTIFIC COMPUTING
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- (2018) Bo Jiang et al. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
- A Sparse Completely Positive Relaxation of the Modularity Maximization for Community Detection
- (2018) Junyu Zhang et al. SIAM JOURNAL ON SCIENTIFIC COMPUTING
- Complete Dictionary Recovery Over the Sphere II: Recovery by Riemannian Trust-Region Method
- (2017) Ju Sun et al. IEEE TRANSACTIONS ON INFORMATION THEORY
- Nonconvex and Nonsmooth Optimization with Generalized Orthogonality Constraints: An Approximate Augmented Lagrangian Method
- (2017) Hong Zhu et al. JOURNAL OF SCIENTIFIC COMPUTING
- Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction
- (2017) Lei Yang et al. SIAM Journal on Imaging Sciences
- A Parallel Douglas–Rachford Algorithm for Minimizing ROF-like Functionals on Images with Values in Symmetric Hadamard Manifolds
- (2016) Ronny Bergmann et al. SIAM Journal on Imaging Sciences
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
- (2016) Mingyi Hong et al. SIAM JOURNAL ON OPTIMIZATION
- Fast community detection by SCORE
- (2015) Jiashun Jin ANNALS OF STATISTICS
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- (2015) Saeed Ghadimi et al. MATHEMATICAL PROGRAMMING
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- (2015) Guoyin Li et al. SIAM JOURNAL ON OPTIMIZATION
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
- (2014) Saeed Ghadimi et al. MATHEMATICAL PROGRAMMING
- Multilinear Sparse Principal Component Analysis
- (2014) Zhihui Lai et al. IEEE Transactions on Neural Networks and Learning Systems
- A Splitting Method for Orthogonality Constrained Problems
- (2013) Rongjie Lai et al. JOURNAL OF SCIENTIFIC COMPUTING
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- (2013) Saeed Ghadimi et al. SIAM JOURNAL ON OPTIMIZATION
- A feasible method for optimization with orthogonality constraints
- (2012) Zaiwen Wen et al. MATHEMATICAL PROGRAMMING
- Projection-like Retractions on Matrix Manifolds
- (2012) P.-A. Absil et al. SIAM JOURNAL ON OPTIMIZATION
- Robust principal component analysis?
- (2011) Emmanuel J. Candès et al. JOURNAL OF THE ACM
- Black box approximation of tensors in hierarchical Tucker format
- (2011) Jonas Ballani et al. LINEAR ALGEBRA AND ITS APPLICATIONS
- Tensor-Train Decomposition
- (2011) I. V. Oseledets SIAM JOURNAL ON SCIENTIFIC COMPUTING
- Non-Negative Multilinear Principal Component Analysis of Auditory Temporal Modulations for Music Genre Classification
- (2009) Y. Panagakis et al. IEEE Transactions on Audio Speech and Language Processing
- TT-cross approximation for multidimensional arrays
- (2009) Ivan Oseledets et al. LINEAR ALGEBRA AND ITS APPLICATIONS
- Tensor Decompositions and Applications
- (2009) Tamara G. Kolda et al. SIAM REVIEW
- MPCA: Multilinear Principal Component Analysis of Tensor Objects
- (2008) Haiping Lu et al. IEEE TRANSACTIONS ON NEURAL NETWORKS
Find Funding. Review Successful Grants.
Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.
ExploreAsk a Question. Answer a Question.
Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.
Get Started