New restricted isometry properties of constrained and unconstrained L*-F minimization for low-rank approximation.

Yu-Hong Dai Y. H. Dai Chinese Academy of Sciences, Institute of Computational Mathematics and Scientific Engineering Computing http://lsec.cc.ac.cn/~dyh https://zbmath.org/authors/?q=ai:dai.yu-hong https://orcid.org/0000-0002-6932-9512

Yan Li Yu-Hong Dai Liping Zhang 0008 New restricted isometry properties of constrained and unconstrained L*-F minimization for low-rank approximation. 2026 April 1107-1143 93 Comput. Optim. Appl. 3 https://doi.org/10.1007/s10589-026-00766-4 db/journals/coap/coap93.html#LiDZ26 streams/journals/coap

Cheng-Liang Li Na Huang 0005 Yu-Hong Dai Chebyshev accelerated parameterized AOR method for time-periodic parabolic optimal control problems. 288 2025 September 44 Comput. Appl. Math. 6 https://doi.org/10.1007/s40314-025-03240-9 db/journals/cam/cam44.html#LiHD25 streams/journals/cam

Sheng-Jie Chen Liang Chen Guang-Ming Li Yu-Hong Dai Preprocessing and valid inequalities for exact detection of critical nodes via integer programming. 215-263 2025 September 92 Comput. Optim. Appl. 1 https://doi.org/10.1007/s10589-025-00698-5 db/journals/coap/coap92.html#ChenCLD25 streams/journals/coap

Jie Liang Cheng-Yang Yu Wei Lv Wei-Kun Chen Yu-Hong Dai Benders decomposition for the large-scale probabilistic set covering problem. 106994 2025 177 Comput. Oper. Res. https://doi.org/10.1016/j.cor.2025.106994 db/journals/cor/cor177.html#LiangYLCD25 streams/journals/cor

Wei Lv Cheng-Yang Yu Jie Liang Wei-Kun Chen Yu-Hong Dai Presolving and cutting planes for the generalized maximal covering location problem. 394-406 2025 327 Eur. J. Oper. Res. 2 https://doi.org/10.1016/j.ejor.2025.05.017 db/journals/eor/eor327.html#LvYLCD25 streams/journals/eor

Sheng-Jie Chen Guang-Ming Li Liang Chen Caixia Kou Yu-Hong Dai Valid inequalities for the β-edge disruptor problem. 38 2025 November 50 J. Comb. Optim. 4 https://doi.org/10.1007/s10878-025-01366-4 db/journals/jco/jco50.html#ChenLCKD25 streams/journals/jco

Zexian Liu Yu-Hong Dai Hongwei Liu 0001 A limited memory subspace minimization conjugate gradient algorithm for unconstrained optimization. 717-745 2025 May 19 Optim. Lett. 4 https://doi.org/10.1007/s11590-024-02131-y db/journals/ol/ol19.html#LiuDL25 streams/journals/ol

Wei-Kun Chen Ya-Feng Liu Yu-Hong Dai Zhi-Quan Luo QoS-Aware and Routing-Flexible Network Slicing for Service-Oriented Networks. 6021-6036 2025 December 22 IEEE Trans. Netw. Serv. Manag. 6 https://doi.org/10.1109/TNSM.2025.3608074 db/journals/tnsm/tnsm22.html#ChenLDL25 streams/journals/tnsm

Quan Yu Yu-Hong Dai Minru Bai Spectral-Spatial Extraction through Layered Tensor Decomposition for Hyperspectral Anomaly Detection. 2025 March abs/2503.05183 CoRR https://doi.org/10.48550/arXiv.2503.05183 db/journals/corr/corr2503.html#abs-2503-05183 streams/journals/corr

Rui-Jin Zhang Xin-Wei Liu Yu-Hong Dai IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming. 1-36 2024 May 88 Comput. Optim. Appl. 1 https://doi.org/10.1007/s10589-024-00558-8 db/journals/coap/coap88.html#ZhangLD24

Zhihua Allen-Zhao 0002 Fengmin Xu Yu-Hong Dai Sanyang Liu Robust enhanced indexation optimization with sparse industry layout constraint. 106420 2024 January 161 Comput. Oper. Res. https://doi.org/10.1016/j.cor.2023.106420 db/journals/cor/cor161.html#AllenZhaoXDL24

Jiang-Yao Luo Liang Chen Weikun Chen Jian-Hua Yuan Yu-Hong Dai A cut-and-solve algorithm for virtual machine consolidation problem. 359-372 2024 154 Future Gener. Comput. Syst. https://doi.org/10.1016/j.future.2024.01.010 https://www.wikidata.org/entity/Q130178192 db/journals/fgcs/fgcs154.html#LuoCCYD24

Yu-Hong Dai Jiani Wang Liwei Zhang Optimality Conditions and Numerical Algorithms for a Class of Linearly Constrained Minimax Optimization Problems. 2883-2916 2024 34 SIAM J. Optim. 3 https://doi.org/10.1137/22m1535243 db/journals/siamjo/siamjo34.html#DaiWZ24 streams/journals/siamjo

Wei-Kun Chen Zheyu Wu Rui-Jin Zhang Ya-Feng Liu Yu-Hong Dai Zhi-Quan Luo An Efficient Benders Decomposition Approach for Optimal Large-Scale Network Slicing. 4935-4949 2024 72 IEEE Trans. Signal Process. https://doi.org/10.1109/TSP.2024.3469382 db/journals/tsp/tsp72.html#ChenWZLDL24 streams/journals/tsp

Zheyu Wu Bo Jiang 0010 Ya-Feng Liu Mingjie Shao Yu-Hong Dai Efficient CI-Based One-Bit Precoding for Multiuser Downlink Massive MIMO Systems With PSK Modulation. 4861-4875 2024 May 23 IEEE Trans. Wirel. Commun. 5 https://doi.org/10.1109/TWC.2023.3323144 db/journals/twc/twc23.html#WuJLSD24

Na Huang 0005 Yu-Hong Dai Dominique Orban Michael A. Saunders An inexact augmented Lagrangian algorithm for unsymmetric saddle-point systems. 2024 abs/2404.14636 CoRR https://doi.org/10.48550/arXiv.2404.14636 db/journals/corr/corr2404.html#abs-2404-14636

Wei-Kun Chen Ya-Feng Liu Yu-Hong Dai Zhi-Quan Luo QoS-Aware and Routing-Flexible Network Slicing for Service-Oriented Networks. 2024 abs/2409.13943 CoRR https://doi.org/10.48550/arXiv.2409.13943 db/journals/corr/corr2409.html#abs-2409-13943 streams/journals/corr

Juan Gao Xinwei Liu Yu-Hong Dai Yakui Huang Junhua Gu Distributed stochastic gradient tracking methods with momentum acceleration for non-convex optimization. 531-572 2023 March 84 Comput. Optim. Appl. 2 https://doi.org/10.1007/s10589-022-00432-5 db/journals/coap/coap84.html#GaoLDHG23

Zhen-Yuan Ji Yu-Hong Dai Greedy PSB methods with explicit superlinear convergence. 753-786 2023 July 85 Comput. Optim. Appl. 3 https://doi.org/10.1007/s10589-023-00495-y db/journals/coap/coap85.html#JiD23

Liang Chen Sheng-Jie Chen Weikun Chen Yu-Hong Dai Tao Quan Juan Chen Efficient presolving methods for solving maximal covering and partial set covering location problems. 73-87 2023 November 311 Eur. J. Oper. Res. 1 https://doi.org/10.1016/j.ejor.2023.04.044 db/journals/eor/eor311.html#ChenCCDQC23

Fengmin Xu Xuepeng Li Yu-Hong Dai Meihua Wang New insights and augmented Lagrangian algorithm for optimal portfolio liquidation with market impact. 2640-2664 2023 30 Int. Trans. Oper. Res. 5 https://doi.org/10.1111/itor.13219 db/journals/itor/itor30.html#XuLDW23

Wei-Kun Chen Liang Chen Yu-Hong Dai Lifting for the integer knapsack cover polyhedron. 205-249 2023 May 86 J. Glob. Optim. 1 https://doi.org/10.1007/s10898-022-01252-x db/journals/jgo/jgo86.html#ChenCD23

Jiawei Chen 0004 Yu-Hong Dai Multiobjective optimization with least constraint violation: optimality conditions and exact penalization. 807-830 2023 November 87 J. Glob. Optim. 2 https://doi.org/10.1007/s10898-022-01158-8 db/journals/jgo/jgo87.html#ChenD23

Rui-Jin Zhang Xin-Wei Liu Yu-Hong Dai IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming. 1027-1053 2023 November 87 J. Glob. Optim. 2 https://doi.org/10.1007/s10898-023-01314-8 db/journals/jgo/jgo87.html#ZhangLD23

Zi Xu Ziqi Wang Jun-Lin Wang Yu-Hong Dai Zeroth-Order Alternating Gradient Descent Ascent Algorithms for A Class of Nonconvex-Nonconcave Minimax Problems. 313:1-313:25 2023 24 J. Mach. Learn. Res. http://jmlr.org/papers/v24/22-1518.html db/journals/jmlr/jmlr24.html#XuWWD23

Yu-Hong Dai Fangfang Xu Liwei Zhang Alternating direction method of multipliers for linear hyperspectral unmixing. 289-310 2023 June 97 Math. Methods Oper. Res. 3 https://doi.org/10.1007/s00186-023-00815-2 db/journals/mmor/mmor97.html#DaiXZ23

Yu-Hong Dai Liwei Zhang The augmented Lagrangian method can approximately solve convex optimization with least constraint violation. 633-667 2023 July 200 Math. Program. 2 https://doi.org/10.1007/s10107-022-01843-2 db/journals/mp/mp200.html#DaiZ23

Sheng-Jie Chen Weikun Chen Yu-Hong Dai Jian-Hua Yuan Houshan Zhang Efficient presolving methods for the influence maximization problem. 229-253 2023 October 82 Networks 3 https://doi.org/10.1002/net.22161 db/journals/networks/networks82.html#ChenCDYZ23

Na Huang 0005 Yu-Hong Dai Dominique Orban Michael A. Saunders Properties of semi-conjugate gradient methods for solving unsymmetric positive definite linear systems. 887-913 2023 September 38 Optim. Methods Softw. 5 https://doi.org/10.1080/10556788.2023.2189716 https://www.wikidata.org/entity/Q133888785 db/journals/oms/oms38.html#HuangDOS23

Na Huang 0005 Yu-Hong Dai Dominique Orban Michael A. Saunders On GSOR, the Generalized Successive Overrelaxation Method for Double Saddle-Point Problems. 2185- 2023 October 45 SIAM J. Sci. Comput. 5 https://doi.org/10.1137/22m1515884 https://www.wikidata.org/entity/Q133888783 db/journals/siamsc/siamsc45.html#HuangDOS23

Juan Gao Xinwei Liu Yu-Hong Dai Yakui Huang Peng Yang 0015 A Family of Distributed Momentum Methods Over Directed Graphs With Linear Convergence. 1085-1092 2023 February 68 IEEE Trans. Autom. Control. 2 https://doi.org/10.1109/TAC.2022.3160684 db/journals/tac/tac68.html#GaoLDHY23

Weikun Chen Ya-Feng Liu Fan Liu 0005 Yu-Hong Dai Zhi-Quan Luo Towards Efficient Large-Scale Network Slicing: An LP Dynamic Rounding-and-Refinement Approach. 615-630 2023 71 IEEE Trans. Signal Process. https://doi.org/10.1109/TSP.2023.3244671 db/journals/tsp/tsp71.html#ChenLLDL23

Zheyu Wu Ya-Feng Liu Bo Jiang 0010 Yu-Hong Dai Efficient Quantized Constant Envelope Precoding for Multiuser Downlink Massive MIMO Systems. 1-5 2023 ICASSP https://doi.org/10.1109/ICASSP49357.2023.10097175 conf/icassp/2023 db/conf/icassp/icassp2023.html#WuLJD23 Wei-Kun Chen Ya-Feng Liu Rui-Jin Zhang Yu-Hong Dai Zhi-Quan Luo An Efficient Decomposition Algorithm for Large-Scale Network Slicing. 171-175 2023 SPAWC https://doi.org/10.1109/SPAWC53906.2023.10304555 conf/spawc/2023 db/conf/spawc/spawc2023.html#ChenLZDL23

Wei-Kun Chen Ya-Feng Liu Rui-Jin Zhang Yu-Hong Dai Zhi-Quan Luo An Efficient Decomposition Algorithm for Large-Scale Network Slicing. 2023 abs/2306.15247 CoRR https://doi.org/10.48550/arXiv.2306.15247 db/journals/corr/corr2306.html#abs-2306-15247

Juan Gao Xin-Wei Liu Yu-Hong Dai Yakui Huang Peng Yang 0015 Achieving geometric convergence for distributed optimization with Barzilai-Borwein step sizes. 2022 65 Sci. China Inf. Sci. 4 https://doi.org/10.1007/s11432-020-3256-x db/journals/chinaf/chinaf65.html#GaoLDHY22

Yakui Huang Yu-Hong Dai Xin-Wei Liu Hongchao Zhang On the acceleration of the Barzilai-Borwein method. 717-740 2022 81 Comput. Optim. Appl. 3 https://doi.org/10.1007/s10589-022-00349-z db/journals/coap/coap81.html#HuangDLZ22

Liang Chen Yu-Hong Dai Zhou Wei Sufficient conditions for existence of global minimizers of functions on Hilbert spaces. 137-147 2022 84 J. Glob. Optim. 1 https://doi.org/10.1007/s10898-022-01133-3 db/journals/jgo/jgo84.html#ChenDW22

Yakui Huang Yu-Hong Dai Xinwei Liu Hongchao Zhang On the Asymptotic Convergence and Acceleration of Gradient Methods. 7 2022 90 J. Sci. Comput. 1 https://doi.org/10.1007/s10915-021-01685-8 db/journals/jscic/jscic90.html#HuangDLZ22

Xin-Wei Liu Yu-Hong Dai Yakui Huang A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs. 351-382 2022 96 Math. Methods Oper. Res. 3 https://doi.org/10.1007/s00186-022-00797-7 db/journals/mmor/mmor96.html#LiuDH22

Xinwei Liu Yu-Hong Dai Yakui Huang Jie Sun 0001 A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints. 1301-1330 2022 November 92 Math. Comput. 341 https://doi.org/10.1090/mcom/3799 db/journals/moc/moc92.html#LiuDHS22

Wei-Kun Chen Ya-Feng Liu Yu-Hong Dai Zhi-Quan Luo Optimal Qos-Aware Network Slicing for Service-Oriented Networks with Flexible Routing. 5288-5292 2022 ICASSP https://doi.org/10.1109/ICASSP43922.2022.9747910 conf/icassp/2022 db/conf/icassp/icassp2022.html#ChenLDL22 Zheyu Wu Bo Jiang 0010 Ya-Feng Liu Yu-Hong Dai A Novel Negative ℓ1 Penalty Approach for Multiuser One-Bit Massive MIMO Downlink with PSK Signaling. 5323-5327 2022 ICASSP https://doi.org/10.1109/ICASSP43922.2022.9747030 conf/icassp/2022 db/conf/icassp/icassp2022.html#WuJLD22

Na Huang 0005 Yu-Hong Dai Dominique Orban Michael A. Saunders A semi-conjugate gradient method for solving unsymmetric positive definite linear systems. 2022 abs/2206.02951 CoRR https://doi.org/10.48550/arXiv.2206.02951 db/journals/corr/corr2206.html#abs-2206-02951

Na Huang 0005 Yu-Hong Dai Dominique Orban Michael A. Saunders On GSOR, the Generalized Successive Overrelaxation Method for Double Saddle-Point Problems. 2022 abs/2208.07499 CoRR https://doi.org/10.48550/arXiv.2208.07499 db/journals/corr/corr2208.html#abs-2208-07499

Zheyu Wu Ya-Feng Liu Bo Jiang 0010 Yu-Hong Dai Efficient Quantized Constant Envelope Precoding for Multiuser Downlink Massive MIMO Systems. 2022 abs/2210.14534 CoRR https://doi.org/10.48550/arXiv.2210.14534 db/journals/corr/corr2210.html#abs-2210-14534

Zi Xu Ziqi Wang Jun-Lin Wang Yu-Hong Dai Zeroth-Order Alternating Gradient Descent Ascent Algorithms for a Class of Nonconvex-Nonconcave Minimax Problems. 2022 abs/2211.13668 CoRR https://doi.org/10.48550/arXiv.2211.13668 db/journals/corr/corr2211.html#abs-2211-13668

Huiling Zhang Jun-Lin Wang Zi Xu Yu-Hong Dai Primal Dual Alternating Proximal Gradient Algorithms for Nonsmooth Nonconvex Minimax Problems with Coupled Linear Constraints. 2022 abs/2212.04672 CoRR https://doi.org/10.48550/arXiv.2212.04672 db/journals/corr/corr2212.html#abs-2212-04672

Jiang-Yao Luo Liang Chen Wei-Kun Chen Jian-Hua Yuan Yu-Hong Dai A Cut-and-solve Algorithm for Virtual Machine Consolidation Problem. 2022 abs/2212.12341 CoRR https://doi.org/10.48550/arXiv.2212.12341 db/journals/corr/corr2212.html#abs-2212-12341

Zhi-Long Dong Jiming Peng Fengmin Xu Yu-Hong Dai On some extended mixed integer optimization models of the Eisenberg-Noe model in systemic risk management. 3014-3037 2021 28 Int. Trans. Oper. Res. 6 https://doi.org/10.1111/itor.12939 db/journals/itor/itor28.html#DongPXD21

Liang Chen Weikun Chen Mu-Ming Yang Yu-Hong Dai An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron. 659-689 2021 81 J. Glob. Optim. 3 https://doi.org/10.1007/s10898-020-00967-z db/journals/jgo/jgo81.html#ChenCYD21

Tengteng Yu Xinwei Liu Yu-Hong Dai Jie Sun 0001 Stochastic Variance Reduced Gradient Methods Using a Trust-Region-Like Scheme. 5 2021 87 J. Sci. Comput. 1 https://doi.org/10.1007/s10915-020-01402-x db/journals/jscic/jscic87.html#YuLDS21

Hui Zhang 0050 Yu-Hong Dai Lei Guo 0022 Wei Peng 0010 Proximal-Like Incremental Aggregated Gradient Method with Linear Convergence Under Bregman Distance Growth Conditions. 61-81 2021 46 Math. Oper. Res. 1 https://doi.org/10.1287/moor.2019.1047 db/journals/mor/mor46.html#0050DGP21

Yakui Huang Yu-Hong Dai Xinwei Liu Equipping the Barzilai-Borwein Method with the Two Dimensional Quadratic Termination Property. 3068-3096 2021 31 SIAM J. Optim. 4 https://doi.org/10.1137/21M1390785 db/journals/siamjo/siamjo31.html#HuangDL21

Tengteng Yu Xinwei Liu Yu-Hong Dai Jie Sun 0001 A Minibatch Proximal Stochastic Recursive Gradient Algorithm Using a Trust-Region-Like Scheme and Barzilai-Borwein Stepsizes. 4627-4638 2021 32 IEEE Trans. Neural Networks Learn. Syst. 10 https://doi.org/10.1109/TNNLS.2020.3025383 https://www.wikidata.org/entity/Q100457140 db/journals/tnn/tnn32.html#YuLDS21

Weikun Chen Ya-Feng Liu Antonio De Domenico Zhi-Quan Luo Yu-Hong Dai Optimal Network Slicing for Service-Oriented Networks With Flexible Routing and Guaranteed E2E Latency. 4337-4352 2021 18 IEEE Trans. Netw. Serv. Manag. 4 https://doi.org/10.1109/TNSM.2021.3087483 db/journals/tnsm/tnsm18.html#ChenLDLD21

Weikun Chen Ya-Feng Liu Yu-Hong Dai Zhi-Quan Luo An Efficient Linear Programming Rounding-and-Refinement Algorithm for Large-Scale Network Slicing Problem. 4735-4739 2021 ICASSP https://doi.org/10.1109/ICASSP39728.2021.9413378 conf/icassp/2021 db/conf/icassp/icassp2021.html#ChenLDL21

Weikun Chen Ya-Feng Liu Yu-Hong Dai Zhi-Quan Luo An efficient linear programming rounding-and-refinement algorithm for large-scale network slicing problem. 2021 abs/2102.02563 CoRR https://arxiv.org/abs/2102.02563 db/journals/corr/corr2102.html#abs-2102-02563

Wei-Kun Chen Ya-Feng Liu Fan Liu 0005 Yu-Hong Dai Zhi-Quan Luo Towards Efficient Large-Scale Network Slicing: An LP Rounding-and-Refinement Approach. 2021 abs/2107.14404 CoRR https://arxiv.org/abs/2107.14404 db/journals/corr/corr2107.html#abs-2107-14404

Wei-Kun Chen Ya-Feng Liu Yu-Hong Dai Zhi-Quan Luo Optimal QoS-Aware Network Slicing for Service-Oriented Networks with Flexible Routing. 2021 abs/2110.03915 CoRR https://arxiv.org/abs/2110.03915 db/journals/corr/corr2110.html#abs-2110-03915

Zheyu Wu Bo Jiang 0010 Ya-Feng Liu Yu-Hong Dai A Novel Negative 𝓁1 Penalty Approach for Multiuser One-Bit Massive MIMO Downlink with PSK Signaling. 2021 abs/2110.04768 CoRR https://arxiv.org/abs/2110.04768 db/journals/corr/corr2110.html#abs-2110-04768

Zheyu Wu Bo Jiang 0010 Ya-Feng Liu Yu-Hong Dai CI-Based One-Bit Precoding for Multiuser Downlink Massive MIMO Systems with PSK Modulation: A Negative 𝓁1 Penalty Approach. 2021 abs/2110.11628 CoRR https://arxiv.org/abs/2110.11628 db/journals/corr/corr2110.html#abs-2110-11628

Zexian Liu Hongwei Liu 0001 Yu-Hong Dai An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization. 145-167 2020 75 Comput. Optim. Appl. 1 https://doi.org/10.1007/s10589-019-00143-4 https://www.wikidata.org/entity/Q126848592 db/journals/coap/coap75.html#LiuLD20

Zhongwen Chen Yu-Hong Dai Jiangyan Liu A penalty-free method with superlinear convergence for equality constrained optimization. 801-833 2020 76 Comput. Optim. Appl. 3 https://doi.org/10.1007/s10589-019-00117-6 https://www.wikidata.org/entity/Q127678679 db/journals/coap/coap76.html#ChenDL20

Zhibao Li Ka Fai Cedric Yiu Yu-Hong Dai Sven Nordholm Distributed LCMV beamformer design by randomly permuted ADMM. 102820 2020 106 Digit. Signal Process. https://doi.org/10.1016/j.dsp.2020.102820 db/journals/dsp/dsp106.html#LiYDN20

Zhi-Long Dong Fengmin Xu Yu-Hong Dai Fast algorithms for sparse portfolio selection considering industries and investment styles. 763-789 2020 78 J. Glob. Optim. 4 https://doi.org/10.1007/s10898-020-00911-1 db/journals/jgo/jgo78.html#DongXD20

Xinwei Liu Yu-Hong Dai A globally convergent primal-dual interior-point relaxation method for nonlinear programs. 1301-1329 2020 89 Math. Comput. 323 https://doi.org/10.1090/mcom/3487 https://www.wikidata.org/entity/Q127297833 db/journals/moc/moc89.html#LiuD20

Yu-Hong Dai Xin Liu 0001 Jiawang Nie Zaiwen Wen Preface. 221-222 2020 35 Optim. Methods Softw. 2 https://doi.org/10.1080/10556788.2019.1698151 db/journals/oms/oms35.html#DaiLNW20

Yakui Huang Yu-Hong Dai Xinwei Liu Hongchao Zhang Gradient methods exploiting spectral properties. 681-705 2020 35 Optim. Methods Softw. 4 https://doi.org/10.1080/10556788.2020.1727476 db/journals/oms/oms35.html#HuangDLZ20

Yu-Hong Dai Florian Jarre Felix Lieder On the existence of affine invariant descent directions. 938-954 2020 35 Optim. Methods Softw. 5 https://doi.org/10.1080/10556788.2020.1740221 db/journals/oms/oms35.html#DaiJL20

Wei Peng 0010 Yu-Hong Dai Hui Zhang 0050 Lizhi Cheng Training GANs with centripetal acceleration. 955-973 2020 35 Optim. Methods Softw. 5 https://doi.org/10.1080/10556788.2020.1754414 db/journals/oms/oms35.html#PengDZC20

Weikun Chen Ya-Feng Liu Antonio De Domenico Zhi-Quan Luo Yu-Hong Dai Optimal Network Slicing for Service-Oriented Networks with Flexible Routing and Guaranteed E2E Latency. 2020 abs/2006.13019 CoRR https://arxiv.org/abs/2006.13019 db/journals/corr/corr2006.html#abs-2006-13019

Tengteng Yu Xinwei Liu Yu-Hong Dai Jie Sun 0001 A variable metric mini-batch proximal stochastic recursive gradient algorithm with diagonal Barzilai-Borwein stepsize. 2020 abs/2010.00817 CoRR https://arxiv.org/abs/2010.00817 db/journals/corr/corr2010.html#abs-2010-00817

Yu-Hong Dai Yakui Huang Xinwei Liu A family of spectral gradient methods for optimization. 43-65 2019 74 Comput. Optim. Appl. 1 https://doi.org/10.1007/s10589-019-00107-8 https://www.wikidata.org/entity/Q127915943 db/journals/coap/coap74.html#DaiHL19

Zhibao Li Yu-Hong Dai Huan Gao Alternating projection method for a class of tensor equations. 490-504 2019 346 J. Comput. Appl. Math. https://doi.org/10.1016/j.cam.2018.07.013 https://www.wikidata.org/entity/Q129460185 db/journals/jcam/jcam346.html#LiDG19

Na Huang 0005 Yu-Hong Dai QiYa Hu Uzawa methods for a class of block three-by-three saddle-point problems. 2019 26 Numer. Linear Algebra Appl. 6 https://doi.org/10.1002/nla.2265 db/journals/nla/nla26.html#HuangDH19

Fengmin Xu Meihua Wang Yu-Hong Dai Dachuan Xu A sparse enhanced indexation model with chance and cardinality constraints. 5-25 2018 70 J. Glob. Optim. 1 https://doi.org/10.1007/s10898-017-0513-1 db/journals/jgo/jgo70.html#XuWDX18

Weikun Chen Liang Chen Mu-Ming Yang Yu-Hong Dai Generalized coefficient strengthening cuts for mixed integer programming. 289-306 2018 70 J. Glob. Optim. 1 https://doi.org/10.1007/s10898-017-0562-5 db/journals/jgo/jgo70.html#ChenCYD18

Wanyou Cheng Yu-Hong Dai Gradient-based method with active set strategy for ℓ1 optimization. 1283-1305 2018 87 Math. Comput. 311 https://doi.org/10.1090/mcom/3238 db/journals/moc/moc87.html#ChengD18

Rui Diao Ya-Feng Liu Yu-Hong Dai A new fully polynomial time approximation scheme for the interval subset sum problem. 749-775 2017 68 J. Glob. Optim. 4 https://doi.org/10.1007/s10898-017-0514-0 db/journals/jgo/jgo68.html#DiaoLD17

Rui Diao Ya-Feng Liu Yu-Hong Dai A New Fully Polynomial Time Approximation Scheme for the Interval Subset Sum Problem. 2017 abs/1704.06928 CoRR http://arxiv.org/abs/1704.06928 db/journals/corr/corr1704.html#DiaoLD17

Zhongwen Chen Yu-Hong Dai A line search exact penalty method with bi-object strategy for nonlinear constrained optimization. 245-258 2016 300 J. Comput. Appl. Math. https://doi.org/10.1016/j.cam.2015.12.033 db/journals/jcam/jcam300.html#ChenD16

Ya-Feng Liu Shiqian Ma Yu-Hong Dai Shuzhong Zhang A smoothing SQP framework for a class of composite Lq minimization over polyhedron. 467-500 2016 158 Math. Program. 1-2 https://doi.org/10.1007/s10107-015-0939-5 db/journals/mp/mp158.html#LiuMDZ16

Conghui Tan Shiqian Ma Yu-Hong Dai Yuqiu Qian Barzilai-Borwein Step Size for Stochastic Gradient Descent. 685-693 2016 NIPS https://proceedings.neurips.cc/paper/2016/hash/c86a7ee3d8ef0b551ed58e354a836f2b-Abstract.html http://papers.nips.cc/paper/6286-barzilai-borwein-step-size-for-stochastic-gradient-descent conf/nips/2016 db/conf/nips/nips2016.html#TanMDQ16

Conghui Tan Shiqian Ma Yu-Hong Dai Yuqiu Qian Barzilai-Borwein Step Size for Stochastic Gradient Descent. 2016 abs/1605.04131 CoRR http://arxiv.org/abs/1605.04131 db/journals/corr/corr1605.html#TanMDQ16

Cai-Xia Kou Yu-Hong Dai A Modified Self-Scaling Memoryless Broyden-Fletcher-Goldfarb-Shanno Method for Unconstrained Optimization. 209-224 2015 165 J. Optim. Theory Appl. 1 https://doi.org/10.1007/s10957-014-0528-4 db/journals/jota/jota165.html#KouD15

Bo Jiang 0010 Yu-Hong Dai A framework of constraint preserving update schemes for optimization on Stiefel manifold. 535-575 2015 153 Math. Program. 2 https://doi.org/10.1007/s10107-014-0816-7 db/journals/mp/mp153.html#JiangD15

Chun-Lin Hao Chun-Feng Cui Yu-Hong Dai A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors. 283-298 2015 22 Numer. Linear Algebra Appl. 2 https://doi.org/10.1002/nla.1949 db/journals/nla/nla22.html#HaoCD15

Ya-Feng Liu Yu-Hong Dai Shiqian Ma Joint Power and Admission Control: Non-Convex Lq Approximation and An Effective Polynomial Time Deflation Approach. 3641-3656 2015 63 IEEE Trans. Signal Process. 14 https://doi.org/10.1109/TSP.2015.2428224 db/journals/tsp/tsp63.html#LiuDM15

Yi-Qing Hu Chun-Lin Hao Yu-Hong Dai Projected gradient algorithms for optimization over order simplices. 1090-1117 2014 29 Optim. Methods Softw. 5 https://doi.org/10.1080/10556788.2014.911872 db/journals/oms/oms29.html#HuHD14

Chun-Feng Cui Yu-Hong Dai Jiawang Nie All Real Eigenvalues of Symmetric Tensors. 1582-1601 2014 35 SIAM J. Matrix Anal. Appl. 4 https://doi.org/10.1137/140962292 db/journals/siammax/siammax35.html#CuiDN14

Ya-Feng Liu Yu-Hong Dai On the Complexity of Joint Subcarrier and Power Allocation for Multi-User OFDMA Systems. 583-596 2014 62 IEEE Trans. Signal Process. 3 https://doi.org/10.1109/TSP.2013.2293130 db/journals/tsp/tsp62.html#LiuD14

Yu-Hong Dai A perfect example for the BFGS method. 501-530 2013 138 Math. Program. 1-2 https://doi.org/10.1007/s10107-012-0522-2 db/journals/mp/mp138.html#Dai13

Bo Jiang 0010 Yu-Hong Dai Feasible Barzilai-Borwein-like methods for extreme symmetric eigenvalue problems. 756-784 2013 28 Optim. Methods Softw. 4 https://doi.org/10.1080/10556788.2012.656115 db/journals/oms/oms28.html#JiangD13

Yu-Hong Dai Cai-Xia Kou A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search. 296-320 2013 23 SIAM J. Optim. 1 https://doi.org/10.1137/100813026 db/journals/siamjo/siamjo23.html#DaiK13

Ya-Feng Liu Mingyi Hong 0001 Yu-Hong Dai Max-Min Fairness Linear Transceiver Design Problem for a Multi-User SIMO Interference Channel is Polynomial Time Solvable. 27-30 2013 20 IEEE Signal Process. Lett. 1 https://doi.org/10.1109/LSP.2012.2227254 db/journals/spl/spl20.html#LiuHD13

Ya-Feng Liu Yu-Hong Dai Zhi-Quan Luo Joint Power and Admission Control via Linear Programming Deflation. 1327-1338 2013 61 IEEE Trans. Signal Process. 6 https://doi.org/10.1109/TSP.2012.2236319 db/journals/tsp/tsp61.html#LiuDL13

Ya-Feng Liu Yu-Hong Dai Zhi-Quan Luo Max-Min Fairness Linear Transceiver Design for a Multi-User MIMO Interference Channel. 2413-2423 2013 61 IEEE Trans. Signal Process. 9 https://doi.org/10.1109/TSP.2013.2245125 db/journals/tsp/tsp61.html#LiuDL13a

Ya-Feng Liu Yu-Hong Dai Joint power and admission control via p norm minimization deflation. 4789-4793 2013 ICASSP https://doi.org/10.1109/ICASSP.2013.6638570 conf/icassp/2013 db/conf/icassp/icassp2013.html#LiuD13

Ya-Feng Liu Yu-Hong Dai Joint power and admission control via p norm minimization deflation http://arxiv.org/abs/1303.1633 2013 CoRR abs/1303.1633 db/journals/corr/corr1303.html#abs-1303-1633

Ya-Feng Liu Yu-Hong Dai Shiqian Ma Joint Power and Admission Control: Non-Convex Approximation and An Efficient Polynomial Time Deflation Approach. 2013 CoRR http://arxiv.org/abs/1311.3045 abs/1311.3045 db/journals/corr/corr1311.html#LiuDM13

Zi Xu Yu-Hong Dai New stochastic approximation algorithms with adaptive step sizes. 1831-1846 2012 6 Optim. Lett. 8 https://doi.org/10.1007/s11590-011-0380-5 db/journals/ol/ol6.html#XuD12

Ya-Feng Liu Yu-Hong Dai Zhi-Quan Luo Joint power and admission control via linear programming deflation. 2873-2876 2012 ICASSP https://doi.org/10.1109/ICASSP.2012.6288517 conf/icassp/2012 db/conf/icassp/icassp2012.html#LiuDL12

Ya-Feng Liu Yu-Hong Dai On the Complexity of Joint Subcarrier and Power Allocation for Multi-User OFDMA Systems http://arxiv.org/abs/1212.5024 2012 CoRR abs/1212.5024 db/journals/corr/corr1212.html#abs-1212-5024

Yu-Hong Dai Convergence of conjugate gradient methods with constant stepsizes. 895-909 2011 26 Optim. Methods Softw. 6 https://doi.org/10.1080/10556781003721042 db/journals/oms/oms26.html#Dai11

Ya-Feng Liu Yu-Hong Dai Zhi-Quan Luo Coordinated Beamforming for MISO Interference Channel: Complexity Analysis and Efficient Algorithms. 1142-1157 2011 59 IEEE Trans. Signal Process. 3 https://doi.org/10.1109/TSP.2010.2092772 db/journals/tsp/tsp59.html#LiuDL11

Ya-Feng Liu Yu-Hong Dai Zhi-Quan Luo Max-Min Fairness Linear Transceiver Design for a Multi-User MIMO Interference Channel. 1-5 2011 ICC https://doi.org/10.1109/icc.2011.5963039 conf/icc/2011 db/conf/icc/icc2011.html#LiuDL11

Yun-Shan Fu Yu-Hong Dai Improved Projected Gradient Algorithms for Singly Linearly Constrained Quadratic Programs Subject to Lower and Upper Bounds. 71-84 2010 27 Asia Pac. J. Oper. Res. 1 https://doi.org/10.1142/S0217595910002594 db/journals/apjor/apjor27.html#FuD10

Ya-Feng Liu Yu-Hong Dai Zhi-Quan Luo On the complexity of optimal coordinated downlink beamforming. 3274-3277 2010 ICASSP https://doi.org/10.1109/ICASSP.2010.5496027 conf/icassp/2010 db/conf/icassp/icassp2010.html#LiuDL10

Gaohang Yu Liqun Qi 0001 Yu-Hong Dai On Nonmonotone Chambolle Gradient Projection Algorithms for Total Variation Image Restoration. 143-154 2009 35 J. Math. Imaging Vis. 2 https://doi.org/10.1007/s10851-009-0160-3 https://www.wikidata.org/entity/Q113106948 db/journals/jmiv/jmiv35.html#YuQD09

Fuxin Li Yun-Shan Fu Yu-Hong Dai Cristian Sminchisescu Jue Wang Kernel Learning by Unconstrained Optimization. 328-335 AISTATS 2009 conf/aistats/2009 http://proceedings.mlr.press/v5/li09a.html db/journals/jmlr/jmlrp5.html#LiFDSW09

Liping Wang Yu-Hong Dai Left conjugate gradient method for non-Hermitian linear systems. 891-909 2008 15 Numer. Linear Algebra Appl. 10 https://doi.org/10.1002/nla.600 db/journals/nla/nla15.html#WangD08

Yi-Qing Hu Yu-Hong Dai Inexact Barzilai-Borwein method for saddle point problems. 299-317 2007 14 Numer. Linear Algebra Appl. 4 https://doi.org/10.1002/nla.516 db/journals/nla/nla14.html#HuD07

Y. H. Dai X. Q. Yang A New Gradient Method with an Optimal Stepsize Property. 73-88 2006 33 Comput. Optim. Appl. 1 https://doi.org/10.1007/s10589-005-5959-2 db/journals/coap/coap33.html#DaiY06

Bin Zhou Li Gao Yu-Hong Dai Gradient Methods with Adaptive Step-Sizes. 69-86 2006 35 Comput. Optim. Appl. 1 https://doi.org/10.1007/s10589-006-6446-0 db/journals/coap/coap35.html#ZhouGD06

Yu-Hong Dai Roger Fletcher New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds. 403-421 2006 106 Math. Program. 3 https://doi.org/10.1007/s10107-005-0595-2 db/journals/mp/mp106.html#DaiF06

Yu-Hong Dai Fast Algorithms for Projection on an Ellipsoid. 986-1006 2006 16 SIAM J. Optim. 4 https://doi.org/10.1137/040613305 db/journals/siamjo/siamjo16.html#Dai06

Yu-Hong Dai Roger Fletcher On the asymptotic behaviour of some new gradient methods. 541-559 2005 103 Math. Program. 3 https://doi.org/10.1007/s10107-004-0516-9 db/journals/mp/mp103.html#DaiF05

Yu-Hong Dai Roger Fletcher Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming. 21-47 2005 100 Numerische Mathematik 1 https://doi.org/10.1007/s00211-004-0569-y db/journals/nm/nm100.html#DaiF05

Yu-Hong Dai Li-Zhi Liao Duan Li 0002 On Restart Procedures for the Conjugate Gradient Method. 249-260 2004 35 Numer. Algorithms 2-4 https://doi.org/10.1023/B:NUMA.0000021761.10993.6e https://www.wikidata.org/entity/Q57445514 db/journals/na/na35.html#DaiLL04

Yu-Hong Dai A family of hybrid conjugate gradient methods for unconstrained optimization. 1317-1328 2003 72 Math. Comput. 243 db/journals/moc/moc72.html#Dai03 https://doi.org/10.1090/S0025-5718-03-01491-1

Yu-Hong Dai José Mario Martínez Jin Yun Yuan An increasing-angle property of the conjugate gradient method and the implementation of large-scale minimization algorithms with line searches. 323-334 2003 10 Numer. Linear Algebra Appl. 4 https://doi.org/10.1002/nla.305 db/journals/nla/nla10.html#DaiMY03

Yu-Hong Dai Jin Yun Yuan Ya-Xiang Yuan Modified Two-Point Stepsize Gradient Methods for Unconstrained Optimization. 103-109 2002 22 Comput. Optim. Appl. 1 https://doi.org/10.1023/A:1014838419611 db/journals/coap/coap22.html#DaiYY02

Yu-Hong Dai Convergence Properties of the BFGS Algoritm. 693-701 2002 13 SIAM J. Optim. 3 https://doi.org/10.1137/S1052623401383455 db/journals/siamjo/siamjo13.html#Dai02

Y. H. Dai Ya-Xiang Yuan An Efficient Hybrid Conjugate Gradient Method for Unconstrained Optimization. 33-47 2001 103 Ann. Oper. Res. 1-4 https://doi.org/10.1023/A:1012930416777 db/journals/anor/anor103.html#DaiY01

Yu-Hong Dai Ya-Xiang Yuan A three-parameter family of nonlinear conjugate gradient methods. 1155-1167 2001 70 Math. Comput. 235 db/journals/moc/moc70.html#DaiY01 https://doi.org/10.1090/S0025-5718-00-01253-9

Yu-Hong Dai Hongchao Zhang Adaptive Two-Point Stepsize Gradient Algorithm. 377-385 2001 27 Numer. Algorithms 4 https://doi.org/10.1023/A:1013844413130 db/journals/na/na27.html#DaiZ01

Yu-Hong Dai New properties of a nonlinear conjugate gradient method. 83-98 2001 89 Numerische Mathematik 1 https://doi.org/10.1007/PL00005464 db/journals/nm/nm89.html#Dai01

Yu-Hong Dai Jiye Han Guanghui Liu Defeng Sun Hongxia Yin Ya-Xiang Yuan Convergence Properties of Nonlinear Conjugate Gradient Methods. 345-358 2000 10 SIAM J. Optim. 2 https://doi.org/10.1137/S1052623494268443 db/journals/siamjo/siamjo10.html#DaiHLSYY00

Yu-Hong Dai Ya-Xiang Yuan Global convergence of the method of shortest residuals. 581-598 1999 83 Numerische Mathematik 4 https://doi.org/10.1007/s002119900080 db/journals/nm/nm83.html#DaiY99

Y. H. Dai Ya-Xiang Yuan A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property. 177-182 1999 10 SIAM J. Optim. 1 https://doi.org/10.1137/S1052623497318992 db/journals/siamjo/siamjo10.html#DaiY99

Minru Bai Jiawei Chen 0004 Juan Chen Liang Chen Sheng-Jie Chen Weikun ChenWei-Kun Chen Zhongwen Chen Lizhi Cheng Wanyou Cheng Chun-Feng Cui Rui Diao Antonio De Domenico Zhi-Long Dong Roger Fletcher Yun-Shan Fu Huan Gao Juan Gao Li Gao Junhua Gu Lei Guo 0022 Jiye Han Chun-Lin Hao Mingyi Hong 0001 QiYa Hu Yi-Qing Hu Na Huang 0005 Yakui Huang Florian Jarre Zhen-Yuan Ji Bo Jiang 0010 Cai-Xia Kou Caixia Kou Cheng-Liang Li Duan Li 0002 Fuxin Li Guang-Ming Li Xuepeng Li Yan Li Zhibao Li Jie Liang Li-Zhi Liao Felix Lieder Fan Liu 0005 Guanghui Liu Hongwei Liu 0001 Jiangyan Liu San Yang LiuSanyang Liu Xin Liu 0001 Xin-Wei Liu Xinwei Liu Ya-Feng Liu Zexian Liu Jiang-Yao Luo Zhi-Quan Luo Wei Lv Shiqian Ma José Mario Martínez Jiawang Nie Sven Nordholm Dominique Orban Jiming Peng Wei Peng 0010 Liqun Qi 0001 Yuqiu Qian Tao Quan Michael A. Saunders Mingjie Shao Cristian Sminchisescu Defeng Sun Jie Sun 0001 Conghui Tan Jiani Wang Jue Wang Jun-Lin Wang Liping Wang Meihua Wang Ziqi Wang Zhou Wei Zaiwen Wen Zheyu Wu Dachuan Xu Fangfang Xu Fengmin Xu Zi Xu Muming YangMu-Ming Yang Peng Yang 0015 X. Q. Yang Hongxia Yin Ka Fai Cedric Yiu Cheng-Yang Yu Gaohang Yu Quan Yu Tengteng Yu Jian-Hua Yuan Jin Yun Yuan Ya-Xiang Yuan Hongchao Zhang Houshan Zhang Hui Zhang 0050 Huiling Zhang Liping Zhang 0008 Liwei Zhang Rui-Jin Zhang Shuzhong Zhang Zhihua Zhao 0002Zhihua Allen-Zhao 0002 Bin Zhou