The following pages link to Rujun Jiang (Q1646572):
Displaying 25 items.
- SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices (Q1646573) (← links)
- Quadratic convex reformulation for quadratic programming with linear on-off constraints (Q1755375) (← links)
- An accelerated first-order method with complexity analysis for solving cubic regularization subproblems (Q2044484) (← links)
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming (Q2274889) (← links)
- Cubic regularization methods with second-order complexity guarantee based on a new subproblem reformulation (Q2676160) (← links)
- Simultaneous Diagonalization of Matrices and Its Applications in Quadratically Constrained Quadratic Programming (Q2817836) (← links)
- Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties (Q4995064) (← links)
- Portfolio Optimization with Nonparametric Value at Risk: A Block Coordinate Descent Method (Q5136074) (← links)
- On Conic Relaxations of Generalization of the Extended Trust Region Subproblem (Q5214417) (← links)
- Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem (Q5231678) (← links)
- A Linear-Time Algorithm for Generalized Trust Region Subproblems (Q5853724) (← links)
- Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem (Q5870365) (← links)
- Exactness Conditions for Semidefinite Programming Relaxations of Generalization of the Extended Trust Region Subproblem (Q6121626) (← links)
- A Riemannian Proximal Newton Method (Q6202763) (← links)
- H\"olderian error bounds and Kurdyka-{\L}ojasiewicz inequality for the trust region subproblem (Q6329944) (← links)
- Fast Algorithms for Stackelberg Prediction Game with Least Squares Loss (Q6367468) (← links)
- Decision Making under Cumulative Prospect Theory: An Alternating Direction Method of Multipliers (Q6413048) (← links)
- A Unified Framework for Rank-based Loss Minimization (Q6513899) (← links)
- "Penalty-based Methods for Simple Bilevel Optimization under H\""{o}lderian Error Bounds" (Q6520185) (← links)
- Near-Optimal Convex Simple Bilevel Optimization with a Bisection Method (Q6520869) (← links)
- Lower-level Duality Based Reformulation and Majorization Minimization Algorithm for Hyperparameter Optimization (Q6524119) (← links)
- Riemannian trust region methods for \(\mathrm{SC}^1\) minimization (Q6629209) (← links)
- A Near-Optimal Algorithm for Convex Simple Bilevel Optimization under Weak Assumptions (Q6744372) (← links)
- Accelerated Gradient Descent by Concatenation of Stepsize Schedules (Q6749073) (← links)
- Linear Convergence of the Proximal Gradient Method for Composite Optimization Under the Polyak-Łojasiewicz Inequality and Its Variant (Q6753935) (← links)
