47 citations · 62 across the 10 of their papers we have counts for
10 papers
Iterative Minimax Games with Coupled Linear Constraints
Huiling Zhang, Zi Xu, Yu-Hong Dai
The study of nonconvex minimax games has gained significant momentum in machine learning and decision science communities due to their fundamental connections to adversarial traini…
Zeroth-Order Alternating Gradient Descent Ascent Algorithms for a Class of Nonconvex-Nonconcave Minimax Problems
Zi Xu, Zi-Qi Wang, Jun-Lin Wang +1
In this paper, we consider a class of nonconvex-nonconcave minimax problems, i.e., NC-PL minimax problems, whose objective functions satisfy the Polyak-Łojasiewicz (PL) condition w…
Simultaneous perturbation stochastic approximation: towards one-measurement per iteration
Shiru Li, Yong Xia, Zi Xu
When measuring the value of a function to be minimized is not only expensive but also with noise, the popular simultaneous perturbation stochastic approximation (SPSA) algorithm re…
A Unified Single-loop Alternating Gradient Projection Algorithm for Nonconvex-Concave and Convex-Nonconcave Minimax Problems
Zi Xu, Huiling Zhang, Yang Xu +1
Much recent research effort has been directed to the development of efficient algorithms for solving minimax problems with theoretical convergence guarantees due to the relevance o…
On the Equivalence of Semidifinite Relaxations for MIMO Detection with General Constellations
Ya-Feng Liu, Zi Xu, Cheng Lu
The multiple-input multiple-output (MIMO) detection problem is a fundamental problem in modern digital communications. Semidefinite relaxation (SDR) based algorithms are a popular…
Joint Multicast Beamforming and User Scheduling in Large-scale Antenna Systems
L. Zhou, Z. Xu, W. Jiang +1
This paper studies the joint multicast beamforming and user scheduling problem, with the objective of minimizing total transmitting power across multiple channels by jointly assign…
An Improved Analysis of Semidefinite Approximation Bound for Nonconvex Nonhomogeneous Quadratic Optimization with Ellipsoid Constraints
Yong Xia, Shu Wang, Zi Xu
We consider the problem of approximating nonconvex quadratic optimization with ellipsoid constraints (ECQP). We show some SDP-based approximation bounds for special cases of (ECQP)…
Semidefinite Relaxation for Two Mixed Binary Quadratically Constrained Quadratic Programs: Algorithms and Approximation Bounds
Zi Xu, Mingyi Hong
This paper develops new semidefinite programming (SDP) relaxation techniques for two classes of mixed binary quadratically constrained quadratic programs (MBQCQP) and analyzes thei…
Semidefinite approximation for mixed binary quadratically constrained quadratic programs
Zi Xu, Mingyi Hong, Zhi-Quan Luo
Motivated by applications in wireless communications, this paper develops semidefinite programming (SDP) relaxation techniques for some mixed binary quadratically constrained quadr…
Joint User Grouping and Linear Virtual Beamforming: Complexity, Algorithms and Approximation Bounds
Mingyi Hong, Zi Xu, Meisam Razaviyayn +1
In a wireless system with a large number of distributed nodes, the quality of communication can be greatly improved by pooling the nodes to perform joint transmission/reception. In…