Zi Xu

Orcid: 0000-0003-0968-8027

According to our database1, Zi Xu authored at least 28 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Two trust region type algorithms for solving nonconvex-strongly concave minimax problems.
CoRR, 2024

Zeroth-Order primal-dual Alternating Projection Gradient Algorithms for Nonconvex Minimax Problems with Coupled linear Constraints.
CoRR, 2024

2023
Simultaneous perturbation stochastic approximation: towards one-measurement per iteration.
Numer. Algorithms, November, 2023

Zeroth-order single-loop algorithms for nonconvex-linear minimax problems.
J. Glob. Optim., November, 2023

Preface: special issue of MOA 2020.
J. Glob. Optim., November, 2023

Cloud-Edge Collaborative Depression Detection Using Negative Emotion Recognition and Cross-Scale Facial Feature Analysis.
IEEE Trans. Ind. Informatics, March, 2023

A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems.
Math. Program., 2023

An accelerated first-order regularized momentum descent ascent algorithm for stochastic nonconvex-concave minimax problems.
CoRR, 2023

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

2021
New Approximation Algorithms for Weighted Maximin Dispersion Problem with Box or Ball Constraints.
J. Optim. Theory Appl., 2021

Zeroth-Order Alternating Randomized Gradient Projection Algorithms for General Nonconvex-Concave Minimax Problems.
CoRR, 2021

An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem.
Comput. Optim. Appl., 2021

2019
Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem.
Optim. Lett., 2019

On the Equivalence of Semidifinite Relaxations for MIMO Detection with General Constellations.
Proceedings of the IEEE International Conference on Acoustics, 2019

2018
Distributed Controllers Seeking AC Optimal Power Flow Solutions Using ADMM.
IEEE Trans. Smart Grid, 2018

Joint multicast beamforming and user scheduling in large-scale antenna systems.
IET Commun., 2018

Fishbone-inspired soft robotic glove for hand rehabilitation with multi-degrees-of-freedom.
Proceedings of the IEEE International Conference on Soft Robotics, 2018

2017
Regulation of renewable energy sources to optimal power flow solutions using ADMM.
Proceedings of the 2017 American Control Conference, 2017

2015
Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints.
Oper. Res. Lett., 2015

2014
Semidefinite Approximation for Mixed Binary Quadratically Constrained Quadratic Programs.
SIAM J. Optim., 2014

Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems.
J. Comb. Optim., 2014

Simulation-Based Optimization by New stochastic Approximation Algorithm.
Asia Pac. J. Oper. Res., 2014

2013
New combinatorial direction stochastic approximation algorithms.
Optim. Methods Softw., 2013

A new hybrid stochastic approximation algorithm.
Optim. Lett., 2013

Joint User Grouping and Linear Virtual Beamforming: Complexity, Algorithms and Approximation Bounds.
IEEE J. Sel. Areas Commun., 2013

2012
New stochastic approximation algorithms with adaptive step sizes.
Optim. Lett., 2012

2010
A combined direction stochastic approximation algorithm.
Optim. Lett., 2010


  Loading...