Smoothing algorithms for nonsmooth optimization over the Stiefel manifold with applications to the graph Fourier basis problem
From MaRDI portal
Publication:6580208
Recommendations
- Proximal gradient method for nonsmooth optimization over the Stiefel manifold
- Nonsmooth optimization over the Stiefel manifold and beyond: proximal gradient method and recent variants
- A collection of nonsmooth Riemannian optimization problems
- A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds
- A penalty-free infeasible approach for a class of nonsmooth optimization problems over the Stiefel manifold
Cites work
- A brief introduction to manifold optimization
- A collection of nonsmooth Riemannian optimization problems
- A feasible method for optimization with orthogonality constraints
- A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- A regularized Newton method for computing ground states of Bose-Einstein condensates
- A Riemannian gradient sampling algorithm for nonsmooth optimization on manifolds
- A splitting method for orthogonality constrained problems
- An Augmented Lagrangian Method for $\ell_{1}$-Regularized Optimization Problems with Orthogonality Constraints
- Compressed modes for variational problems in mathematics and physics
- Conjugate gradient algorithm for optimization under unitary matrix constraint
- Convex analysis and monotone operator theory in Hilbert spaces
- Data-driven tight frame construction and image denoising
- Discrete Signal Processing on Graphs
- Discrete Signal Processing on Graphs: Frequency Analysis
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Global rates of convergence for nonconvex optimization on manifolds
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds
- Iteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvature
- Line search algorithms for locally Lipschitz functions on Riemannian manifolds
- Manifolds of Negative Curvature
- Non-existence of continuous convex functions on certain Riemannian manifolds
- Nonconvex TV^q-models in image restoration: analysis and a trust-region regularization-based superlinearly convergent solver
- Nondifferentiable optimization via smooth approximation: General analytical approach
- Nonsmooth optimization and its applications. Based on the workshop ``Nonsmooth Optimization and its Applications, Bonn, Germany, May 15--19, 2017
- Optimality conditions for the nonlinear programming problems on Riemannian manifolds
- Optimization algorithms exploiting unitary constraints
- Orientation estimation of cryo-EM images using projected gradient descent method
- Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints
- Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis
- Projection-like retractions on matrix manifolds
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal gradient method for nonsmooth optimization over the Stiefel manifold
- Proximité et dualité dans un espace hilbertien
- Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods
- Riemannian proximal gradient methods
- Sampling in Paley-Wiener spaces on combinatorial graphs
- Smooth minimization of non-smooth functions
- Smoothing functions for second-order-cone complementarity problems
- Smoothing methods for convex inequalities and linear complementarity problems
- Smoothing methods for nonsmooth, nonconvex minimization
- Smoothing technique and its applications in semidefinite optimization
- Sparse principal component analysis and iterative thresholding
- Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint
- Subgradient algorithm on Riemannian manifolds
- The Geometry of Algorithms with Orthogonality Constraints
- Three-dimensional structure determination from common lines in cryo-EM by eigenvectors and semidefinite programming
- Two-Point Step Size Gradient Methods
- Vertex-frequency analysis on graphs
- Weakly convex optimization over Stiefel manifold using Riemannian subgradient-type methods
This page was built for publication: Smoothing algorithms for nonsmooth optimization over the Stiefel manifold with applications to the graph Fourier basis problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6580208)
