Yangyang Xu
Orcid: 0000-0002-4163-3723Affiliations:
- Rensselaer Polytechnic Institute, Troy, NY, USA
According to our database1,
Yangyang Xu authored at least 40 papers
between 2011 and 2026.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2026
Variance-reduced accelerated methods for decentralized stochastic double-regularized nonconvex strongly-concave minimax problems.
Trans. Mach. Learn. Res., 2026
Lower Complexity Bounds of First-Order Methods for Affinely Constrained Composite Nonconvex Problems.
Math. Oper. Res., 2026
2025
A stochastic smoothing framework for nonconvex-nonconcave min-sum-max problems with applications to Wasserstein distributionally robust optimization.
CoRR, February, 2025
2024
Correction to: Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization.
Comput. Optim. Appl., November, 2024
Decentralized Gradient Descent Maximization Method for Composite Nonconvex Strongly-Concave Minimax Problems.
SIAM J. Optim., March, 2024
Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization.
Comput. Optim. Appl., January, 2024
Jointly Improving the Sample and Communication Complexities in Decentralized Stochastic Minimax Optimization.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
2023
Correntropy-Based Low-Rank Matrix Factorization With Constraint Graph Learning for Image Clustering.
IEEE Trans. Neural Networks Learn. Syst., December, 2023
Math. Program. Comput., September, 2023
Correntropy based model predictive controller with multi-constraints for robust path trajectory tracking of self-driving vehicle.
J. Frankl. Inst., July, 2023
IEEE Trans. Signal Process., 2023
Momentum-Based Variance-Reduced Proximal Stochastic Gradient Method for Composite Nonconvex Stochastic Optimization.
J. Optim. Theory Appl., 2023
Proximal Stochastic Recursive Momentum Methods for Nonconvex Composite Decentralized Optimization.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023
2022
Distributed Stochastic Inertial-Accelerated Methods with Delayed Derivatives for Nonconvex Problems.
SIAM J. Imaging Sci., 2022
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022
2021
INFORMS J. Optim., October, 2021
Augmented Lagrangian-Based First-Order Methods for Convex-Constrained Programs with Weakly Convex Objective.
INFORMS J. Optim., October, 2021
First-Order Methods for Constrained Convex Programming Based on Linearized Augmented Lagrangian Function.
INFORMS J. Optim., January, 2021
Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming.
Math. Program., 2021
Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems.
Math. Program., 2021
Rate-improved inexact augmented Lagrangian method for constrained nonconvex optimization.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021
2020
Maximum Correntropy Criterion-Based Robust Semisupervised Concept Factorization for Image Representation.
IEEE Trans. Neural Networks Learn. Syst., 2020
2019
Maximum Correntropy Criterion-Based Sparse Subspace Learning for Unsupervised Feature Selection.
IEEE Trans. Circuits Syst. Video Technol., 2019
Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs.
Comput. Optim. Appl., 2019
2017
A Globally Convergent Algorithm for Nonconvex Optimization Based on Block Coordinate Update.
J. Sci. Comput., 2017
2016
SIAM J. Sci. Comput., 2016
Global and local structure preserving sparse subspace learning: An iterative approach to unsupervised feature selection.
Pattern Recognit., 2016
CoRR, 2016
2015
SIAM J. Optim., 2015
Local-Structure Adaptive Sparse Subspace Learning: An Iterative Approach to Unsupervised Feature Selection.
CoRR, 2015
2014
2013
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
2012
Proceedings of the 2012 IEEE International Conference on Acoustics, 2012
2011
CoRR, 2011