Global convergence of the method of shortest residuals. - Yu-Hong Dai; Ya-Xiang Yuan (Numerische Mathematik, 1999)

A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property. - Y. H. Dai; Ya-Xiang Yuan (SIAM J. Optim., 1999)

Convergence Properties of Nonlinear Conjugate Gradient Methods. - Yu-Hong Dai; Jiye Han; Guanghui Liu; Defeng Sun; Hongxia Yin; Ya-Xiang Yuan (SIAM J. Optim., 2000)

An Efficient Hybrid Conjugate Gradient Method for Unconstrained Optimization. - Y. H. Dai; Ya-Xiang Yuan (Ann. Oper. Res., 2001)

A three-parameter family of nonlinear conjugate gradient methods. - Yu-Hong Dai; Ya-Xiang Yuan (Math. Comput., 2001)

Adaptive Two-Point Stepsize Gradient Algorithm. - Yu-Hong Dai; Hongchao Zhang (Numer. Algorithms, 2001)

New properties of a nonlinear conjugate gradient method. - Yu-Hong Dai (Numerische Mathematik, 2001)

Modified Two-Point Stepsize Gradient Methods for Unconstrained Optimization. - Yu-Hong Dai; Jin Yun Yuan; Ya-Xiang Yuan (Comput. Optim. Appl., 2002)

Convergence Properties of the BFGS Algoritm. - Yu-Hong Dai (SIAM J. Optim., 2002)

A family of hybrid conjugate gradient methods for unconstrained optimization. - Yu-Hong Dai (Math. Comput., 2003)

An increasing-angle property of the conjugate gradient method and the implementation of large-scale minimization algorithms with line searches. - Yu-Hong Dai; José Mario Martínez; Jin Yun Yuan (Numer. Linear Algebra Appl., 2003)

On Restart Procedures for the Conjugate Gradient Method. - Yu-Hong Dai; Li-Zhi Liao; Duan Li 002 (Numer. Algorithms, 2004)

On the asymptotic behaviour of some new gradient methods. - Yu-Hong Dai; Roger Fletcher (Math. Program., 2005)

Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming. - Yu-Hong Dai; Roger Fletcher (Numerische Mathematik, 2005)

A New Gradient Method with an Optimal Stepsize Property. - Y. H. Dai; X. Q. Yang (Comput. Optim. Appl., 2006)

Gradient Methods with Adaptive Step-Sizes. - Bin Zhou; Li Gao; Yu-Hong Dai (Comput. Optim. Appl., 2006)

New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds. - Yu-Hong Dai; Roger Fletcher (Math. Program., 2006)

Fast Algorithms for Projection on an Ellipsoid. - Yu-Hong Dai (SIAM J. Optim., 2006)

Inexact Barzilai-Borwein method for saddle point problems. - Yi-Qing Hu; Yu-Hong Dai (Numer. Linear Algebra Appl., 2007)

Left conjugate gradient method for non-Hermitian linear systems. - Liping Wang; Yu-Hong Dai (Numer. Linear Algebra Appl., 2008)

On Nonmonotone Chambolle Gradient Projection Algorithms for Total Variation Image Restoration. - Gaohang Yu; Liqun Qi 001; Yu-Hong Dai (J. Math. Imaging Vis., 2009)

Kernel Learning by Unconstrained Optimization. - Fuxin Li; Yun-Shan Fu; Yu-Hong Dai; Cristian Sminchisescu; Jue Wang (AISTATS, 2009)

On the complexity of optimal coordinated downlink beamforming. - Ya-Feng Liu; Yu-Hong Dai; Zhi-Quan Luo (ICASSP, 2010)

Improved Projected Gradient Algorithms for Singly Linearly Constrained Quadratic Programs Subject to Lower and Upper Bounds. - Yun-Shan Fu; Yu-Hong Dai (Asia Pac. J. Oper. Res., 2010)

Convergence of conjugate gradient methods with constant stepsizes. - Yu-Hong Dai (Optim. Methods Softw., 2011)

Coordinated Beamforming for MISO Interference Channel: Complexity Analysis and Efficient Algorithms. - Ya-Feng Liu; Yu-Hong Dai; Zhi-Quan Luo (IEEE Trans. Signal Process., 2011)

New stochastic approximation algorithms with adaptive step sizes. - Zi Xu; Yu-Hong Dai (Optim. Lett., 2012)

Joint power and admission control via p norm minimization deflation. - Ya-Feng Liu; Yu-Hong Dai (ICASSP, 2013)

Joint Power and Admission Control: Non-Convex Approximation and An Efficient Polynomial Time Deflation Approach. - Ya-Feng Liu; Yu-Hong Dai; Shiqian Ma (CoRR, 2013)

A perfect example for the BFGS method. - Yu-Hong Dai (Math. Program., 2013)

Feasible Barzilai-Borwein-like methods for extreme symmetric eigenvalue problems. - Bo Jiang 010; Yu-Hong Dai (Optim. Methods Softw., 2013)

A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search. - Yu-Hong Dai; Cai-Xia Kou (SIAM J. Optim., 2013)

Max-Min Fairness Linear Transceiver Design Problem for a Multi-User SIMO Interference Channel is Polynomial Time Solvable. - Ya-Feng Liu; Mingyi Hong 001; Yu-Hong Dai (IEEE Signal Process. Lett., 2013)

Joint Power and Admission Control via Linear Programming Deflation. - Ya-Feng Liu; Yu-Hong Dai; Zhi-Quan Luo (IEEE Trans. Signal Process., 2013)

Max-Min Fairness Linear Transceiver Design for a Multi-User MIMO Interference Channel. - Ya-Feng Liu; Yu-Hong Dai; Zhi-Quan Luo (IEEE Trans. Signal Process., 2013)

Projected gradient algorithms for optimization over order simplices. - Yi-Qing Hu; Chun-Lin Hao; Yu-Hong Dai (Optim. Methods Softw., 2014)

All Real Eigenvalues of Symmetric Tensors. - Chun-Feng Cui; Yu-Hong Dai; Jiawang Nie (SIAM J. Matrix Anal. Appl., 2014)

On the Complexity of Joint Subcarrier and Power Allocation for Multi-User OFDMA Systems. - Ya-Feng Liu; Yu-Hong Dai (IEEE Trans. Signal Process., 2014)

A Modified Self-Scaling Memoryless Broyden-Fletcher-Goldfarb-Shanno Method for Unconstrained Optimization. - Cai-Xia Kou; Yu-Hong Dai (J. Optim. Theory Appl., 2015)

A framework of constraint preserving update schemes for optimization on Stiefel manifold. - Bo Jiang 010; Yu-Hong Dai (Math. Program., 2015)

A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors. - Chun-Lin Hao; Chun-Feng Cui; Yu-Hong Dai (Numer. Linear Algebra Appl., 2015)

Joint Power and Admission Control: Non-Convex Lq Approximation and An Effective Polynomial Time Deflation Approach. - Ya-Feng Liu; Yu-Hong Dai; Shiqian Ma (IEEE Trans. Signal Process., 2015)

Barzilai-Borwein Step Size for Stochastic Gradient Descent. - Conghui Tan; Shiqian Ma; Yu-Hong Dai; Yuqiu Qian (NIPS, 2016)

A line search exact penalty method with bi-object strategy for nonlinear constrained optimization. - Zhongwen Chen; Yu-Hong Dai (J. Comput. Appl. Math., 2016)

A smoothing SQP framework for a class of composite Lq minimization over polyhedron. - Ya-Feng Liu; Shiqian Ma; Yu-Hong Dai; Shuzhong Zhang (Math. Program., 2016)

A new fully polynomial time approximation scheme for the interval subset sum problem. - Rui Diao; Ya-Feng Liu; Yu-Hong Dai (J. Glob. Optim., 2017)

Generalized coefficient strengthening cuts for mixed integer programming. - Weikun Chen; Liang Chen; Mu-Ming Yang; Yu-Hong Dai (J. Glob. Optim., 2018)

A sparse enhanced indexation model with chance and cardinality constraints. - Fengmin Xu; Meihua Wang; Yu-Hong Dai; Dachuan Xu (J. Glob. Optim., 2018)

Gradient-based method with active set strategy for ℓ1 optimization. - Wanyou Cheng; Yu-Hong Dai (Math. Comput., 2018)

A family of spectral gradient methods for optimization. - Yu-Hong Dai; Yakui Huang; Xinwei Liu (Comput. Optim. Appl., 2019)

Alternating projection method for a class of tensor equations. - Zhibao Li; Yu-Hong Dai; Huan Gao (J. Comput. Appl. Math., 2019)

Uzawa methods for a class of block three-by-three saddle-point problems. - Na Huang; Yu-Hong Dai; QiYa Hu (Numer. Linear Algebra Appl., 2019)

A penalty-free method with superlinear convergence for equality constrained optimization. - Zhongwen Chen; Yu-Hong Dai; Jiangyan Liu (Comput. Optim. Appl., 2020)

An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization. - Zexian Liu; Hongwei Liu 001; Yu-Hong Dai (Comput. Optim. Appl., 2020)

A variable metric mini-batch proximal stochastic recursive gradient algorithm with diagonal Barzilai-Borwein stepsize. - Tengteng Yu; Xinwei Liu; Yu-Hong Dai; Jie Sun 001 (CoRR, 2020)

Distributed LCMV beamformer design by randomly permuted ADMM. - Zhibao Li; Ka Fai Cedric Yiu; Yu-Hong Dai; Sven Nordholm (Digit. Signal Process., 2020)

Fast algorithms for sparse portfolio selection considering industries and investment styles. - Zhi-Long Dong; Fengmin Xu; Yu-Hong Dai (J. Glob. Optim., 2020)

A globally convergent primal-dual interior-point relaxation method for nonlinear programs. - Xinwei Liu; Yu-Hong Dai (Math. Comput., 2020)

On the existence of affine invariant descent directions. - Yu-Hong Dai; Florian Jarre; Felix Lieder (Optim. Methods Softw., 2020)

Preface. - Yu-Hong Dai; Xin Liu 001; Jiawang Nie; Zaiwen Wen (Optim. Methods Softw., 2020)

Gradient methods exploiting spectral properties. - Yakui Huang; Yu-Hong Dai; Xinwei Liu; Hongchao Zhang (Optim. Methods Softw., 2020)

Training GANs with centripetal acceleration. - Wei Peng 010; Yu-Hong Dai; Hui Zhang 050; Lizhi Cheng (Optim. Methods Softw., 2020)

An Efficient Linear Programming Rounding-and-Refinement Algorithm for Large-Scale Network Slicing Problem. - Weikun Chen; Ya-Feng Liu; Yu-Hong Dai; Zhi-Quan Luo (ICASSP, 2021)

Towards Efficient Large-Scale Network Slicing: An LP Rounding-and-Refinement Approach. - Wei-Kun Chen; Ya-Feng Liu; Fan Liu 005; Yu-Hong Dai; Zhi-Quan Luo (CoRR, 2021)

A Novel Negative 𝓁1 Penalty Approach for Multiuser One-Bit Massive MIMO Downlink with PSK Signaling. - Zheyu Wu; Bo Jiang 010; Ya-Feng Liu; Yu-Hong Dai (CoRR, 2021)

CI-Based One-Bit Precoding for Multiuser Downlink Massive MIMO Systems with PSK Modulation: A Negative 𝓁1 Penalty Approach. - Zheyu Wu; Bo Jiang 010; Ya-Feng Liu; Yu-Hong Dai (CoRR, 2021)

On some extended mixed integer optimization models of the Eisenberg-Noe model in systemic risk management. - Zhi-Long Dong; Jiming Peng; Fengmin Xu; Yu-Hong Dai (Int. Trans. Oper. Res., 2021)

An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron. - Liang Chen; Weikun Chen; Mu-Ming Yang; Yu-Hong Dai (J. Glob. Optim., 2021)

Stochastic Variance Reduced Gradient Methods Using a Trust-Region-Like Scheme. - Tengteng Yu; Xinwei Liu; Yu-Hong Dai; Jie Sun 001 (J. Sci. Comput., 2021)

Proximal-Like Incremental Aggregated Gradient Method with Linear Convergence Under Bregman Distance Growth Conditions. - Hui Zhang 050; Yu-Hong Dai; Lei Guo 022; Wei Peng 010 (Math. Oper. Res., 2021)

Equipping the Barzilai-Borwein Method with the Two Dimensional Quadratic Termination Property. - Yakui Huang; Yu-Hong Dai; Xinwei Liu (SIAM J. Optim., 2021)

A Minibatch Proximal Stochastic Recursive Gradient Algorithm Using a Trust-Region-Like Scheme and Barzilai-Borwein Stepsizes. - Tengteng Yu; Xinwei Liu; Yu-Hong Dai; Jie Sun 001 (IEEE Trans. Neural Networks Learn. Syst., 2021)

Optimal Network Slicing for Service-Oriented Networks With Flexible Routing and Guaranteed E2E Latency. - Weikun Chen; Ya-Feng Liu; Antonio De Domenico; Zhi-Quan Luo; Yu-Hong Dai (IEEE Trans. Netw. Serv. Manag., 2021)

Optimal Qos-Aware Network Slicing for Service-Oriented Networks with Flexible Routing. - Wei-Kun Chen; Ya-Feng Liu; Yu-Hong Dai; Zhi-Quan Luo (ICASSP, 2022)

A Novel Negative ℓ1 Penalty Approach for Multiuser One-Bit Massive MIMO Downlink with PSK Signaling. - Zheyu Wu; Bo Jiang 010; Ya-Feng Liu; Yu-Hong Dai (ICASSP, 2022)

Achieving geometric convergence for distributed optimization with Barzilai-Borwein step sizes. - Juan Gao; Xin-Wei Liu; Yu-Hong Dai; Yakui Huang; Peng Yang 015 (Sci. China Inf. Sci., 2022)

On the acceleration of the Barzilai-Borwein method. - Yakui Huang; Yu-Hong Dai; Xin-Wei Liu; Hongchao Zhang (Comput. Optim. Appl., 2022)

A semi-conjugate gradient method for solving unsymmetric positive definite linear systems. - Na Huang; Yu-Hong Dai; Dominique Orban; Michael A. Saunders (CoRR, 2022)

Primal Dual Alternating Proximal Gradient Algorithms for Nonsmooth Nonconvex Minimax Problems with Coupled Linear Constraints. - Huiling Zhang; Jun-Lin Wang; Zi Xu; Yu-Hong Dai (CoRR, 2022)

Sufficient conditions for existence of global minimizers of functions on Hilbert spaces. - Liang Chen; Yu-Hong Dai; Zhou Wei (J. Glob. Optim., 2022)

On the Asymptotic Convergence and Acceleration of Gradient Methods. - Yakui Huang; Yu-Hong Dai; Xinwei Liu; Hongchao Zhang (J. Sci. Comput., 2022)

A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs. - Xin-Wei Liu; Yu-Hong Dai; Yakui Huang (Math. Methods Oper. Res., 2022)

A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints. - Xinwei Liu; Yu-Hong Dai; Yakui Huang; Jie Sun 001 (Math. Comput., 2022)

Efficient Quantized Constant Envelope Precoding for Multiuser Downlink Massive MIMO Systems. - Zheyu Wu; Ya-Feng Liu; Bo Jiang 010; Yu-Hong Dai (ICASSP, 2023)

An Efficient Decomposition Algorithm for Large-Scale Network Slicing. - Wei-Kun Chen; Ya-Feng Liu; Rui-Jin Zhang; Yu-Hong Dai; Zhi-Quan Luo (SPAWC, 2023)

New insights and augmented Lagrangian algorithm for optimal portfolio liquidation with market impact. - Fengmin Xu; Xuepeng Li; Yu-Hong Dai; Meihua Wang (Int. Trans. Oper. Res., 2023)

Zeroth-Order Alternating Gradient Descent Ascent Algorithms for A Class of Nonconvex-Nonconcave Minimax Problems. - Zi Xu; Ziqi Wang; Jun-Lin Wang; Yu-Hong Dai (J. Mach. Learn. Res., 2023)

Towards Efficient Large-Scale Network Slicing: An LP Dynamic Rounding-and-Refinement Approach. - Weikun Chen; Ya-Feng Liu; Fan Liu 005; Yu-Hong Dai; Zhi-Quan Luo (IEEE Trans. Signal Process., 2023)

A Family of Distributed Momentum Methods Over Directed Graphs With Linear Convergence. - Juan Gao; Xinwei Liu; Yu-Hong Dai; Yakui Huang; Peng Yang 015 (IEEE Trans. Autom. Control., 2023)

Distributed stochastic gradient tracking methods with momentum acceleration for non-convex optimization. - Juan Gao; Xinwei Liu; Yu-Hong Dai; Yakui Huang; Junhua Gu (Comput. Optim. Appl., 2023)

Lifting for the integer knapsack cover polyhedron. - Wei-Kun Chen; Liang Chen; Yu-Hong Dai (J. Glob. Optim., 2023)

Alternating direction method of multipliers for linear hyperspectral unmixing. - Yu-Hong Dai; Fangfang Xu; Liwei Zhang (Math. Methods Oper. Res., 2023)

Greedy PSB methods with explicit superlinear convergence. - Zhen-Yuan Ji; Yu-Hong Dai (Comput. Optim. Appl., 2023)

The augmented Lagrangian method can approximately solve convex optimization with least constraint violation. - Yu-Hong Dai; Liwei Zhang (Math. Program., 2023)

Properties of semi-conjugate gradient methods for solving unsymmetric positive definite linear systems. - Na Huang; Yu-Hong Dai; Dominique Orban; Michael A. Saunders (Optim. Methods Softw., 2023)

Efficient presolving methods for the influence maximization problem. - Sheng-Jie Chen; Weikun Chen; Yu-Hong Dai; Jian-Hua Yuan; Houshan Zhang (Networks, 2023)

On GSOR, the Generalized Successive Overrelaxation Method for Double Saddle-Point Problems. - Na Huang; Yu-Hong Dai; Dominique Orban; Michael A. Saunders (SIAM J. Sci. Comput., 2023)

Efficient presolving methods for solving maximal covering and partial set covering location problems. - Liang Chen; Sheng-Jie Chen; Weikun Chen; Yu-Hong Dai; Tao Quan; Juan Chen (Eur. J. Oper. Res., 2023)

Multiobjective optimization with least constraint violation: optimality conditions and exact penalization. - Jiawei Chen 004; Yu-Hong Dai (J. Glob. Optim., 2023)

IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming. - Rui-Jin Zhang; Xin-Wei Liu; Yu-Hong Dai (J. Glob. Optim., 2023)

An inexact augmented Lagrangian algorithm for unsymmetric saddle-point systems. - Na Huang; Yu-Hong Dai; Dominique Orban; Michael A. Saunders (CoRR, 2024)

QoS-Aware and Routing-Flexible Network Slicing for Service-Oriented Networks. - Wei-Kun Chen; Ya-Feng Liu; Yu-Hong Dai; Zhi-Quan Luo (CoRR, 2024)

A cut-and-solve algorithm for virtual machine consolidation problem. - Jiang-Yao Luo; Liang Chen; Weikun Chen; Jian-Hua Yuan; Yu-Hong Dai (Future Gener. Comput. Syst., 2024)

Optimality Conditions and Numerical Algorithms for a Class of Linearly Constrained Minimax Optimization Problems. - Yu-Hong Dai; Jiani Wang; Liwei Zhang (SIAM J. Optim., 2024)

An Efficient Benders Decomposition Approach for Optimal Large-Scale Network Slicing. - Wei-Kun Chen; Zheyu Wu; Rui-Jin Zhang; Ya-Feng Liu; Yu-Hong Dai; Zhi-Quan Luo (IEEE Trans. Signal Process., 2024)

Robust enhanced indexation optimization with sparse industry layout constraint. - Zhihua Allen-Zhao 002; Fengmin Xu; Yu-Hong Dai; Sanyang Liu (Comput. Oper. Res., 2024)

IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming. - Rui-Jin Zhang; Xin-Wei Liu; Yu-Hong Dai (Comput. Optim. Appl., 2024)

Efficient CI-Based One-Bit Precoding for Multiuser Downlink Massive MIMO Systems With PSK Modulation. - Zheyu Wu; Bo Jiang 010; Ya-Feng Liu; Mingjie Shao; Yu-Hong Dai (IEEE Trans. Wirel. Commun., 2024)

Benders decomposition for the large-scale probabilistic set covering problem. - Jie Liang; Cheng-Yang Yu; Wei Lv; Wei-Kun Chen; Yu-Hong Dai (Comput. Oper. Res., 2025)

Presolving and cutting planes for the generalized maximal covering location problem. - Wei Lv; Cheng-Yang Yu; Jie Liang; Wei-Kun Chen; Yu-Hong Dai (Eur. J. Oper. Res., 2025)

Spectral-Spatial Extraction through Layered Tensor Decomposition for Hyperspectral Anomaly Detection. - Quan Yu; Yu-Hong Dai; Minru Bai (CoRR, 2025)

A limited memory subspace minimization conjugate gradient algorithm for unconstrained optimization. - Zexian Liu; Yu-Hong Dai; Hongwei Liu 001 (Optim. Lett., 2025)

Chebyshev accelerated parameterized AOR method for time-periodic parabolic optimal control problems. - Cheng-Liang Li; Na Huang; Yu-Hong Dai (Comput. Appl. Math., 2025)

Preprocessing and valid inequalities for exact detection of critical nodes via integer programming. - Sheng-Jie Chen; Liang Chen; Guang-Ming Li; Yu-Hong Dai (Comput. Optim. Appl., 2025)