( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Near-Optimal Convex Simple Bilevel Optimization with a Bisection Method.

, , и . AISTATS, том 238 из Proceedings of Machine Learning Research, стр. 2008-2016. PMLR, (2024)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Ping Jiang

Jiang Yi

Xin Jiang

Kaiyun Jiang

Qiu Jiang

 

Другие публикации лиц с тем же именем

A Linear-Time Algorithm for Generalized Trust Region Subproblems., и . SIAM J. Optim., 30 (1): 915-932 (2020)Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming., и . J. Glob. Optim., 75 (2): 461-494 (2019)LPA-SD: An Efficient First-Order Method for Single-Group Multicast Beamforming., , и . SPAWC, стр. 1-5. IEEE, (2018)Solving Stackelberg Prediction Game with Least Squares Loss via Spherically Constrained Least Squares Reformulation., , , , и . ICML, том 162 из Proceedings of Machine Learning Research, стр. 22665-22679. PMLR, (2022)Lower-level Duality Based Reformulation and Majorization Minimization Algorithm for Hyperparameter Optimization., , , и . AISTATS, том 238 из Proceedings of Machine Learning Research, стр. 784-792. PMLR, (2024)A Riemannian Proximal Newton Method., , , , и . SIAM J. Optim., 34 (1): 654-681 (марта 2024)Exactness Conditions for Semidefinite Programming Relaxations of Generalization of the Extended Trust Region Subproblem., и . Math. Oper. Res., 48 (3): 1235-1253 (августа 2023)Quadratic convex reformulation for quadratic programming with linear on-off constraints., , и . Eur. J. Oper. Res., 274 (3): 824-836 (2019)Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties., , , , и . INFORMS J. Comput., 33 (1): 180-197 (2021)Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem., и . SIAM J. Optimization, 29 (2): 1603-1633 (2019)