Yangyang Xu

According to our database1, Yangyang Xu authored at least 57 papers between 2011 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.



In proceedings 
PhD thesis 


On csauthors.net:


Maximum Correntropy Criterion-Based Robust Semisupervised Concept Factorization for Image Representation.
IEEE Trans. Neural Networks Learn. Syst., 2020

Primal-Dual Stochastic Gradient Method for Convex Programs with Many Functional Constraints.
SIAM J. Optim., 2020

A locally and cubically convergent algorithm for computing 𝒵-eigenpairs of symmetric tensors.
Numer. Linear Algebra Appl., 2020

First-order methods for problems with O(1) functional constraints can have almost the same convergence rate as for unconstrained problems.
CoRR, 2020

Momentum-based variance-reduced proximal stochastic gradient method for composite nonconvex stochastic optimization.
CoRR, 2020

Augmented Lagrangian based first-order methods for convex and nonconvex programs: nonergodic convergence and iteration complexity.
CoRR, 2020

Asynchronous parallel adaptive stochastic gradient methods.
CoRR, 2020

Markov chain block coordinate descent.
Comput. Optim. Appl., 2020

Maximum Correntropy Criterion-Based Sparse Subspace Learning for Unsupervised Feature Selection.
IEEE Trans. Circuits Syst. Video Technol., 2019

Two non-parameter iterative algorithms for identifying strong ℋ-tensors.
Numer. Algorithms, 2019

Some criteria for identifying strong ℋ-tensors.
Numer. Algorithms, 2019

Katyusha Acceleration for Convex Finite-Sum Compositional Optimization.
CoRR, 2019

Inexact Proximal-Point Penalty Methods for Non-Convex Optimization with Non-Convex Constraints.
CoRR, 2019

Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs.
Comput. Optim. Appl., 2019

SSSER: Spatiotemporal Sequential and Social Embedding Rank for Successive Point-of-Interest Recommendation.
IEEE Access, 2019

Ensemble One-Dimensional Convolution Neural Networks for Skeleton-Based Action Recognition.
IEEE Signal Process. Lett., 2018

Hybrid Jacobian and Gauss-Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming.
SIAM J. Optim., 2018

HOSVD based multidimensional parameter estimation for massive MIMO system from incomplete channel measurements.
Multidimens. Syst. Signal Process., 2018

ADMM for the SDP relaxation of the QAP.
Math. Program. Comput., 2018

Markov Chain Block Coordinate Descent.
CoRR, 2018

Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization.
Comput. Optim. Appl., 2018

Human Action Recognition by Learning Spatio-Temporal Features With Deep Neural Networks.
IEEE Access, 2018

A Block Coordinate Ascent Algorithm for Mean-Variance Optimization.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Robust PCA via Dictionary Based Outlier Pursuit.
Proceedings of the 2018 IEEE International Conference on Acoustics, 2018

Fuzzy clustering algorithms for identification of Exocarpium Citrus Grandis through chromatography.
Soft Comput., 2017

Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming.
SIAM J. Optim., 2017

A unified information measure for general binary relations.
Knowl. Based Syst., 2017

A Globally Convergent Algorithm for Nonconvex Optimization Based on Block Coordinate Update.
J. Sci. Comput., 2017

First-order methods for constrained convex programming based on linearized augmented Lagrangian function.
CoRR, 2017

Global convergence rates of augmented Lagrangian methods for constrained convex programming.
CoRR, 2017

Asynchronous parallel primal-dual block update methods.
CoRR, 2017

Differentially Private Big Data Publication via Structural Inference and Community Detection.
Proceedings of the 14th International Symposium on Pervasive Systems, 2017

ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates.
SIAM J. Sci. Comput., 2016

Global and local structure preserving sparse subspace learning: An iterative approach to unsupervised feature selection.
Pattern Recognit., 2016

Proximal gradient method for huberized support vector machine.
Pattern Anal. Appl., 2016

Ascending partition method for differentially private histogram publication.
Comput. Syst. Sci. Eng., 2016

On the Convergence of Asynchronous Parallel Iteration with Arbitrary Delays.
CoRR, 2016

Coordinate Friendly Structures, Algorithms and Applications.
CoRR, 2016

Group sparse nonnegative matrix factorization for hyperspectral image denoising.
Proceedings of the 2016 IEEE International Geoscience and Remote Sensing Symposium, 2016

Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization.
SIAM J. Optim., 2015

Alternating proximal gradient method for sparse nonnegative Tucker decomposition.
Math. Program. Comput., 2015

Local-Structure Adaptive Sparse Subspace Learning: An Iterative Approach to Unsupervised Feature Selection.
CoRR, 2015

To Enlighten Hidden Facts in The Code: A Review of Software Visualization Metaphors.
Proceedings of the 27th International Conference on Software Engineering and Knowledge Engineering, 2015

Context-aware Recommendation System with Anonymous User Profile Learning.
Proceedings of the 27th International Conference on Software Engineering and Knowledge Engineering, 2015

A new efficient bypass coding scheme based on logarithmic domain.
Proceedings of the 2015 Picture Coding Symposium, 2015

Alternating Direction Method of Multipliers for Regularized Multiclass Support Vector Machines.
Proceedings of the Machine Learning, Optimization, and Big Data, 2015

High-throughput and low-complexity binary arithmetic decoder based on logarithmic domain.
Proceedings of the 2015 IEEE International Conference on Image Processing, 2015

A fast patch-dictionary method for whole image recovery.
CoRR, 2014

On Higher-order Singular Value Decomposition from Incomplete Data.
CoRR, 2014

Sparse Bilinear Logistic Regression.
CoRR, 2014

Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed 퓁<sub>q</sub> Minimization.
SIAM J. Numer. Anal., 2013

A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion.
SIAM J. Imaging Sci., 2013

Parallel matrix factorization for low-rank tensor completion.
CoRR, 2013

Multitask <i>n</i>-vehicle exploration problem: Complexity and algorithm.
J. Syst. Sci. Complex., 2012

Decentralized low-rank matrix completion.
Proceedings of the 2012 IEEE International Conference on Acoustics, 2012

A variant of multitask n-vehicle exploration problem: maximizing every processor's average profit
CoRR, 2011

An Alternating Direction Algorithm for Matrix Completion with Nonnegative Factors
CoRR, 2011