Rujun Jiang
Orcid: 0000-0002-6610-6778
According to our database1,
Rujun Jiang
authored at least 24 papers
between 2016 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
J. Sci. Comput., November, 2024
RSAP-DFM: Regime-Shifting Adaptive Posterior Dynamic Factor Model for Stock Returns Prediction.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024
Lower-level Duality Based Reformulation and Majorization Minimization Algorithm for Hyperparameter Optimization.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024
2023
Exactness Conditions for Semidefinite Programming Relaxations of Generalization of the Extended Trust Region Subproblem.
Math. Oper. Res., August, 2023
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
2022
Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem.
Math. Oper. Res., November, 2022
Tackling A Class of Hard Subset-Sum Problems: Integration of Lattice Attacks with Disaggregation Techniques.
CoRR, 2022
Solving Stackelberg Prediction Game with Least Squares Loss via Spherically Constrained Least Squares Reformulation.
Proceedings of the International Conference on Machine Learning, 2022
2021
Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties.
INFORMS J. Comput., 2021
An accelerated first-order method with complexity analysis for solving cubic regularization subproblems.
Comput. Optim. Appl., 2021
Proceedings of the 38th International Conference on Machine Learning, 2021
2020
SIAM J. Optim., 2020
2019
Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem.
SIAM J. Optim., 2019
Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming.
J. Glob. Optim., 2019
Quadratic convex reformulation for quadratic programming with linear on-off constraints.
Eur. J. Oper. Res., 2019
Semidefinite Programming Based Convex Relaxation for Nonconvex Quadratically Constrained Quadratic Programming.
Proceedings of the Optimization of Complex Systems: Theory, 2019
Proceedings of the Optimization of Complex Systems: Theory, 2019
2018
SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices.
Math. Program., 2018
Portfolio Optimization with Nonparametric Value at Risk: A Block Coordinate Descent Method.
INFORMS J. Comput., 2018
Proceedings of the 19th IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2018
2016
Simultaneous Diagonalization of Matrices and Its Applications in Quadratically Constrained Quadratic Programming.
SIAM J. Optim., 2016