Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold (Q5210519)

scientific article; zbMATH DE number 7154039

Language	Label	Description	Also known as
English	Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold	scientific article; zbMATH DE number 7154039

Statements

instance of

scholarly article

0 references

title

Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold (English)

0 references

published in

SIAM Journal on Optimization

0 references

publication date

21 January 2020

0 references

full work available at URL

https://arxiv.org/abs/1811.00980

0 references

zbMATH Keywords

manifold optimization

0 references

Stiefel manifold

0 references

nonsmooth

0 references

proximal gradient method

0 references

iteration complexity

0 references

semismooth Newton method

0 references

sparse PCA

0 references

compressed modes

0 references

describes a project that uses

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint

0 references

Conjugate gradient algorithm for optimization under unitary matrix constraint

0 references

A collection of nonsmooth Riemannian optimization problems

0 references

Q5433140

0 references

Low-rank retractions: a survey and new results

0 references

Fast Image Recovery Using Variable Splitting and Constrained Optimization

0 references

Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality

0 references

Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity

0 references

A Second Order Nonsmooth Variational Model for Restoring Manifold-Valued Images

0 references

Non-Convex Phase Retrieval From STFT Measurements

0 references

A new approach to the proximal point method: convergence on general Riemannian manifolds

0 references

Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds

0 references

Manifolds of Negative Curvature

0 references

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

A Riemannian subgradient algorithm for economic dispatch with valve-point effect

0 references

Nonconvex Phase Synchronization

0 references

Global rates of convergence for nonconvex optimization on manifolds

0 references

Manopt, a Matlab toolbox for optimization on manifolds

0 references

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers

0 references

An Augmented Lagrangian Method for $\ell_{1}$-Regularized Optimization Problems with Orthogonality Constraints

0 references

A Direct Formulation for Sparse PCA Using Semidefinite Programming

0 references

Nonsmooth Riemannian Optimization with Applications to Sphere Packing and Grasping

0 references

The Geometry of Algorithms with Orthogonality Constraints

0 references

Finite-Dimensional Variational Inequalities and Complementarity Problems

0 references

Subgradient algorithm on Riemannian manifolds

0 references

Proximal Point Algorithm On Riemannian Manifolds

0 references

Q3038523

0 references

A dual algorithm for the solution of nonlinear variational problems via finite element approximation

0 references

Q3995612

0 references

Q4144736

0 references

The Split Bregman Method for L1-Regularized Problems

0 references

Q4917542

0 references

Nonsmooth trust region algorithms for locally Lipschitz functions on Riemannian manifolds

0 references

$\varepsilon$-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds

0 references

Generalized Hessian matrix and second-order optimality conditions for problems with $C^{1,1}$ data

0 references

Line Search Algorithms for Locally Lipschitz Functions on Riemannian Manifolds

0 references

Generalized gradients and characterization of epi-Lipschitz sets in Riemannian manifolds

0 references

A Riemannian Gradient Sampling Algorithm for Nonsmooth Optimization on Manifolds

0 references

Blind Deconvolution by a Steepest Descent Algorithm on a Quotient Manifold

0 references

A framework of constraint preserving update schemes for optimization on Stiefel manifold

0 references

Generalized power method for sparse principal component analysis

0 references

A splitting method for orthogonality constrained problems

0 references

A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems

0 references

Splitting Algorithms for the Sum of Two Nonlinear Operators

0 references

Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods

0 references

On the Estimation Performance and Convergence Rate of the Generalized Power Method for Phase Synchronization

0 references

Alternating direction method of multipliers for sparse principal component analysis

0 references

Q4039873

0 references

Semismooth and Semiconvex Functions in Constrained Optimization

0 references

Compressed modes for variational problems in mathematics and physics

0 references

An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem

0 references

A nonsmooth version of Newton's method

0 references

Variational Analysis

0 references

Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors

0 references

Sparse principal component analysis via regularized low rank matrix approximation

0 references

Q4252831

0 references

Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture

0 references

A geometric analysis of phase retrieval

0 references

Q5198964

0 references

Low-Rank Matrix Completion by Riemannian Optimization

0 references

Solving Log-Determinant Optimization Problems by a Newton-CG Primal Proximal Point Algorithm

0 references

Global convergence of ADMM in nonconvex nonsmooth optimization

0 references

A feasible method for optimization with orthogonality constraints

0 references

A regularized semi-smooth Newton method with projection steps for composite convex programs

0 references

A Proximal Point Algorithm for Log-Determinant Optimization with Group Lasso Regularization

0 references

A Fast Algorithm for Edge-Preserving Variational Multichannel Image Restoration

0 references

SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints

0 references

Q4979597

0 references

Nearly unbiased variable selection under minimax concave penalty

0 references

Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis

0 references

A Newton-CG Augmented Lagrangian Method for Semidefinite Programming

0 references

Superlinear convergence of a Newton-type algorithm for monotone equations

0 references

Nonconvex and nonsmooth optimization with generalized orthogonality constraints: an approximate augmented Lagrangian method

0 references

Identifiers

zbMATH Open document ID

1434.90195

0 references

DOI

10.1137/18M122457X

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5210519