Rujun Jiang

Orcid: 0000-0002-6610-6778

According to our database1, Rujun Jiang authored at least 19 papers between 2016 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Riemannian Proximal Newton Method.
SIAM J. Optim., March, 2024

2023
Exactness Conditions for Semidefinite Programming Relaxations of Generalization of the Extended Trust Region Subproblem.
Math. Oper. Res., August, 2023

A Unified Framework for Rank-based Loss Minimization.
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

Fast Algorithms for Stackelberg Prediction Game with Least Squares Loss.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
A Linear-Time Algorithm for Generalized Trust Region Subproblems.
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

On Conic Relaxations of Generalization of the Extended Trust Region Subproblem.
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

LPA-SD: An Efficient First-Order Method for Single-Group Multicast Beamforming.
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


  Loading...