Yu-Hong Dai
Orcid: 0000-0002-6932-9512Affiliations:
- Chinese Academy of Sciences, Institute of Computational Mathematics and Scientific Engineering Computing
According to our database1,
Yu-Hong Dai
authored at least 102 papers
between 1999 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2024
Comput. Oper. Res., January, 2024
2023
IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming.
J. Glob. Optim., November, 2023
Multiobjective optimization with least constraint violation: optimality conditions and exact penalization.
J. Glob. Optim., November, 2023
Efficient presolving methods for solving maximal covering and partial set covering location problems.
Eur. J. Oper. Res., November, 2023
On GSOR, the Generalized Successive Overrelaxation Method for Double Saddle-Point Problems.
SIAM J. Sci. Comput., October, 2023
Networks, October, 2023
Properties of semi-conjugate gradient methods for solving unsymmetric positive definite linear systems.
Optim. Methods Softw., September, 2023
The augmented Lagrangian method can approximately solve convex optimization with least constraint violation.
Math. Program., July, 2023
Comput. Optim. Appl., July, 2023
Math. Methods Oper. Res., June, 2023
Distributed stochastic gradient tracking methods with momentum acceleration for non-convex optimization.
Comput. Optim. Appl., March, 2023
A Family of Distributed Momentum Methods Over Directed Graphs With Linear Convergence.
IEEE Trans. Autom. Control., February, 2023
Towards Efficient Large-Scale Network Slicing: An LP Dynamic Rounding-and-Refinement Approach.
IEEE Trans. Signal Process., 2023
New insights and augmented Lagrangian algorithm for optimal portfolio liquidation with market impact.
Int. Trans. Oper. Res., 2023
Proceedings of the 24th IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2023
Efficient Quantized Constant Envelope Precoding for Multiuser Downlink Massive MIMO Systems.
Proceedings of the IEEE International Conference on Acoustics, 2023
2022
A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints.
Math. Comput., November, 2022
A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs.
Math. Methods Oper. Res., 2022
J. Sci. Comput., 2022
Sufficient conditions for existence of global minimizers of functions on Hilbert spaces.
J. Glob. Optim., 2022
Primal Dual Alternating Proximal Gradient Algorithms for Nonsmooth Nonconvex Minimax Problems with Coupled Linear Constraints.
CoRR, 2022
Zeroth-Order Alternating Gradient Descent Ascent Algorithms for a Class of Nonconvex-Nonconcave Minimax Problems.
CoRR, 2022
A semi-conjugate gradient method for solving unsymmetric positive definite linear systems.
CoRR, 2022
Achieving geometric convergence for distributed optimization with Barzilai-Borwein step sizes.
Sci. China Inf. Sci., 2022
A Novel Negative ℓ1 Penalty Approach for Multiuser One-Bit Massive MIMO Downlink with PSK Signaling.
Proceedings of the IEEE International Conference on Acoustics, 2022
Optimal Qos-Aware Network Slicing for Service-Oriented Networks with Flexible Routing.
Proceedings of the IEEE International Conference on Acoustics, 2022
2021
Optimal Network Slicing for Service-Oriented Networks With Flexible Routing and Guaranteed E2E Latency.
IEEE Trans. Netw. Serv. Manag., 2021
A Minibatch Proximal Stochastic Recursive Gradient Algorithm Using a Trust-Region-Like Scheme and Barzilai-Borwein Stepsizes.
IEEE Trans. Neural Networks Learn. Syst., 2021
Equipping the Barzilai-Borwein Method with the Two Dimensional Quadratic Termination Property.
SIAM J. Optim., 2021
Proximal-Like Incremental Aggregated Gradient Method with Linear Convergence Under Bregman Distance Growth Conditions.
Math. Oper. Res., 2021
J. Sci. Comput., 2021
An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron.
J. Glob. Optim., 2021
On some extended mixed integer optimization models of the Eisenberg-Noe model in systemic risk management.
Int. Trans. Oper. Res., 2021
CI-Based One-Bit Precoding for Multiuser Downlink Massive MIMO Systems with PSK Modulation: A Negative 𝓁<sub>1</sub> Penalty Approach.
CoRR, 2021
A Novel Negative 𝓁<sub>1</sub> Penalty Approach for Multiuser One-Bit Massive MIMO Downlink with PSK Signaling.
CoRR, 2021
Towards Efficient Large-Scale Network Slicing: An LP Rounding-and-Refinement Approach.
CoRR, 2021
An Efficient Linear Programming Rounding-and-Refinement Algorithm for Large-Scale Network Slicing Problem.
Proceedings of the IEEE International Conference on Acoustics, 2021
2020
A globally convergent primal-dual interior-point relaxation method for nonlinear programs.
Math. Comput., 2020
Fast algorithms for sparse portfolio selection considering industries and investment styles.
J. Glob. Optim., 2020
Digit. Signal Process., 2020
A variable metric mini-batch proximal stochastic recursive gradient algorithm with diagonal Barzilai-Borwein stepsize.
CoRR, 2020
Comput. Optim. Appl., 2020
A penalty-free method with superlinear convergence for equality constrained optimization.
Comput. Optim. Appl., 2020
2019
Numer. Linear Algebra Appl., 2019
J. Comput. Appl. Math., 2019
2018
Math. Comput., 2018
J. Glob. Optim., 2018
J. Glob. Optim., 2018
2017
A new fully polynomial time approximation scheme for the interval subset sum problem.
J. Glob. Optim., 2017
2016
A smoothing SQP framework for a class of composite L<sub>q</sub> minimization over polyhedron.
Math. Program., 2016
A line search exact penalty method with bi-object strategy for nonlinear constrained optimization.
J. Comput. Appl. Math., 2016
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016
2015
Joint Power and Admission Control: Non-Convex L<sub>q</sub> Approximation and An Effective Polynomial Time Deflation Approach.
IEEE Trans. Signal Process., 2015
A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors.
Numer. Linear Algebra Appl., 2015
A framework of constraint preserving update schemes for optimization on Stiefel manifold.
Math. Program., 2015
A Modified Self-Scaling Memoryless Broyden-Fletcher-Goldfarb-Shanno Method for Unconstrained Optimization.
J. Optim. Theory Appl., 2015
2014
On the Complexity of Joint Subcarrier and Power Allocation for Multi-User OFDMA Systems.
IEEE Trans. Signal Process., 2014
Optim. Methods Softw., 2014
2013
Max-Min Fairness Linear Transceiver Design for a Multi-User MIMO Interference Channel.
IEEE Trans. Signal Process., 2013
IEEE Trans. Signal Process., 2013
Max-Min Fairness Linear Transceiver Design Problem for a Multi-User SIMO Interference Channel is Polynomial Time Solvable.
IEEE Signal Process. Lett., 2013
A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search.
SIAM J. Optim., 2013
Optim. Methods Softw., 2013
Joint Power and Admission Control: Non-Convex Approximation and An Efficient Polynomial Time Deflation Approach.
CoRR, 2013
Proceedings of the IEEE International Conference on Acoustics, 2013
2012
2011
Coordinated Beamforming for MISO Interference Channel: Complexity Analysis and Efficient Algorithms.
IEEE Trans. Signal Process., 2011
Optim. Methods Softw., 2011
2010
Improved Projected Gradient Algorithms for Singly Linearly Constrained Quadratic Programs Subject to Lower and Upper Bounds.
Asia Pac. J. Oper. Res., 2010
Proceedings of the IEEE International Conference on Acoustics, 2010
2009
Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics, 2009
On Nonmonotone Chambolle Gradient Projection Algorithms for Total Variation Image Restoration.
J. Math. Imaging Vis., 2009
2008
Numer. Linear Algebra Appl., 2008
2007
Numer. Linear Algebra Appl., 2007
2006
New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds.
Math. Program., 2006
2005
Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming.
Numerische Mathematik, 2005
2004
2003
An increasing-angle property of the conjugate gradient method and the implementation of large-scale minimization algorithms with line searches.
Numer. Linear Algebra Appl., 2003
Math. Comput., 2003
2002
Comput. Optim. Appl., 2002
2001
Math. Comput., 2001
Ann. Oper. Res., 2001
2000
1999
SIAM J. Optim., 1999