scientific article; zbMATH DE number 7594709

DOI10.12286/jssx.j2020-0731MaRDI QIDQ5038021

Chungen Shen, Ling Mi, Xue Xue

Publication date: 29 September 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

global convergenceglobal implicit function theoremspherical constraint\(\ell_1\) regularizationtochastic gradient estimation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• An inexact successive quadratic approximation method for L-1 regularized optimization
• Projection algorithms for nonconvex minimization with application to sparse principal component analysis
• A splitting method for orthogonality constrained problems
• A coordinate gradient descent method for nonsmooth separable minimization
• Subgradient algorithm on Riemannian manifolds
• A regularized semi-smooth Newton method with projection steps for composite convex programs
• Principal component analysis.
• Convergence of stochastic proximal gradient algorithm
• Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds
• Generalized power method for sparse principal component analysis
• Proximal Newton-Type Methods for Minimizing Composite Functions
• Finding a Sparse Vector in a Subspace: Linear Sparsity Using Alternating Directions
• Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
• Complete Dictionary Recovery Over the Sphere II: Recovery by Riemannian Trust-Region Method
• Two-Point Step Size Gradient Methods
• Proximal Point Algorithm On Riemannian Manifolds
• Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint
• Global rates of convergence for nonconvex optimization on manifolds
• An investigation of Newton-Sketch and subsampled Newton methods
• Inexact proximal stochastic second-order methods for nonconvex composite optimization
• Stochastic proximal quasi-Newton methods for non-convex composite optimization
• Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold
• A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization
• A Proximal Stochastic Gradient Method with Progressive Variance Reduction
• Stochastic Gradient Descent on Riemannian Manifolds
• Online Principal Components Analysis
• A Direct Formulation for Sparse PCA Using Semidefinite Programming
• Exact and inexact subsampled Newton methods for optimization
• Subsampled inexact Newton methods for minimizing large sums of convex functions
• A further result on an implicit function theorem for locally Lipschitz functions
• Benchmarking optimization software with performance profiles.
• Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization

This page was built for publication: