default search action
Xingju Cai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j28]Ting Li, Yongzhong Song
, Xingju Cai
Improved Accelerated Gradient Algorithms with Line Search for Smooth Convex Optimization Problems. Asia Pac. J. Oper. Res. 41(3): 2350030:1-2350030:24 (2024) - [j27]Zehui Jia, Wenxing Zhang, Xingju Cai, Deren Han:
Stochastic alternating structure-adapted proximal gradient descent method with variance reduction for nonconvex nonsmooth optimization. Math. Comput. 93(348): 1677-1714 (2024) - [i1]Endong Gu, Yongxin Chen, Hao Wen, Xingju Cai, Deren Han:
Novel clustered federated learning based on local loss. CoRR abs/2407.09360 (2024) - 2023
- [j26]Yumin Ma, Ting Li, Yongzhong Song, Xingju Cai:
Majorized iPADMM for Nonseparable Convex Minimization Models with Quadratic Coupling Terms. Asia Pac. J. Oper. Res. 40(1): 2240002:1-2240002:35 (2023) - [j25]Xue Gao, Xingju Cai, Xiangfeng Wang, Deren Han
An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant. J. Glob. Optim. 87(1): 277-300 (2023) - [j24]Ting Li, Xingju Cai, Yongzhong Song, Yumin Ma
Improved variance reduction extragradient method with line search for stochastic variational inequalities. J. Glob. Optim. 87(2): 423-446 (2023) - [j23]Fan Jiang, Xingju Cai, Deren Han:
Inexact asymmetric forward-backward-adjoint splitting algorithms for saddle point problems. Numer. Algorithms 94(1): 479-509 (2023) - 2022
- [j22]Xue Gao, Xingju Cai, Xueye Wang:
Self-Adaptive Inertial Projection and Contraction Algorithm for Monotone Variational Inequality. Asia Pac. J. Oper. Res. 39(2): 2150021:1-2150021:21 (2022) - [j21]Zhongming Wu, Xingju Cai, Min Li
Optimal mixed charging schemes for traffic congestion management with subsidy to new energy vehicle users. Int. Trans. Oper. Res. 29(1): 6-23 (2022) - [j20]Yaning Jiang, Deren Han, Xingju Cai:
An efficient partial parallel method with scaling step size strategy for three-block convex optimization problems. Math. Methods Oper. Res. 96(3): 383-419 (2022) - [j19]Fan Jiang, Zhongming Wu, Xingju Cai, Hongchao Zhang:
Unified linear convergence of first-order primal-dual algorithms for saddle point problems. Optim. Lett. 16(6): 1675-1700 (2022) - 2021
- [j18]Xingju Cai, Min Li, Guanghui Wang, Dachuan Xu
Preface. Asia Pac. J. Oper. Res. 38(5): 2102002:1-2102002:2 (2021) - [j17]Chun Zhang, Yongzhong Song, Xingju Cai, Deren Han:
An extended proximal ADMM algorithm for three-block nonconvex optimization problems. J. Comput. Appl. Math. 398: 113681 (2021) - [j16]Zehui Jia, Jieru Huang, Xingju Cai
Proximal-like incremental aggregated gradient method with Bregman distance in weakly convex optimization problems. J. Glob. Optim. 80(4): 841-864 (2021) - [j15]Zehui Jia, Xue Gao, Xingju Cai, Deren Han:
Local Linear Convergence of the Alternating Direction Method of Multipliers for Nonconvex Separable Optimization Problems. J. Optim. Theory Appl. 188(1): 1-25 (2021) - [j14]Fan Jiang, Xingju Cai, Zhongming Wu, Deren Han:
Approximate first-order primal-dual algorithms for saddle point problems. Math. Comput. 90(329): 1227-1262 (2021) - [j13]Fan Jiang, Zhongming Wu, Xingju Cai, Hongchao Zhang:
A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems. Numer. Algorithms 88(3): 1109-1136 (2021) - 2020
- [j12]Xiaomei Dong, Xingju Cai, Deren Han, Zhili Ge:
Solving a Class of Variational Inequality Problems with a New Inexact Strategy. Asia Pac. J. Oper. Res. 37(1): 1950038:1-1950038:20 (2020) - [j11]Yaning Jiang, Xingju Cai, Deren Han:
Solving policy design problems: Alternating direction method of multipliers-based methods for structured inverse variational inequalities. Eur. J. Oper. Res. 280(2): 417-427 (2020) - [j10]Xue Gao, Xingju Cai, Deren Han:
A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems. J. Glob. Optim. 76(4): 863-887 (2020)
2010 – 2019
- 2019
- [j9]Yan Gu, Xingju Cai, Deren Han, David Z. W. Wang
A tri-level optimization model for a private road competition problem with traffic equilibrium constraints. Eur. J. Oper. Res. 273(1): 190-197 (2019) - [j8]Xingju Cai:
A proximal point algorithm with asymmetric linear term. Optim. Lett. 13(4): 777-793 (2019) - 2017
- [j7]Xingju Cai, Deren Han, Xiaoming Yuan:
On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function. Comput. Optim. Appl. 66(1): 39-73 (2017) - [j6]Zehui Jia, Xingju Cai, Deren Han:
Comparison of several fast algorithms for projection onto an ellipsoid. J. Comput. Appl. Math. 319: 320-337 (2017) - 2015
- [j5]Hongjin He, Xingju Cai, Deren Han:
A fast splitting method tailored for Dantzig selector. Comput. Optim. Appl. 62(2): 347-372 (2015) - [j4]Hongjin He, Xingju Cai, Deren Han:
A class of nonlinear proximal point algorithms for variational inequality problems. Int. J. Comput. Math. 92(7): 1385-1401 (2015) - 2014
- [j3]Xingju Cai, Guoyong Gu, Bingsheng He:
On the O(1/t) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators. Comput. Optim. Appl. 57(2): 339-363 (2014) - 2013
- [j2]Deren Han, Xiaoming Yuan
An ADM-based splitting method for separable convex programming. Comput. Optim. Appl. 54(2): 343-369 (2013) - [j1]Xingju Cai, Deren Han, Lingling Xu:
An improved first-order primal-dual algorithm with a new correction step. J. Glob. Optim. 57(4): 1419-1428 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 23:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: