Xingju Cai
Orcid: 0000-0002-6957-477X
According to our database1,
Xingju Cai
authored at least 29 papers
between 2013 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
7
3
4
4
6
3
2
2
2
1
2
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Improved Accelerated Gradient Algorithms with Line Search for Smooth Convex Optimization Problems.
Asia Pac. J. Oper. Res., June, 2024
Stochastic alternating structure-adapted proximal gradient descent method with variance reduction for nonconvex nonsmooth optimization.
Math. Comput., 2024
2023
Improved variance reduction extragradient method with line search for stochastic variational inequalities.
J. Glob. Optim., November, 2023
Inexact asymmetric forward-backward-adjoint splitting algorithms for saddle point problems.
Numer. Algorithms, September, 2023
An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant.
J. Glob. Optim., September, 2023
Majorized iPADMM for Nonseparable Convex Minimization Models with Quadratic Coupling Terms.
Asia Pac. J. Oper. Res., February, 2023
2022
Unified linear convergence of first-order primal-dual algorithms for saddle point problems.
Optim. Lett., 2022
An efficient partial parallel method with scaling step size strategy for three-block convex optimization problems.
Math. Methods Oper. Res., 2022
Optimal mixed charging schemes for traffic congestion management with subsidy to new energy vehicle users.
Int. Trans. Oper. Res., 2022
Self-Adaptive Inertial Projection and Contraction Algorithm for Monotone Variational Inequality.
Asia Pac. J. Oper. Res., 2022
2021
A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems.
Numer. Algorithms, 2021
Math. Comput., 2021
Local Linear Convergence of the Alternating Direction Method of Multipliers for Nonconvex Separable Optimization Problems.
J. Optim. Theory Appl., 2021
Proximal-like incremental aggregated gradient method with Bregman distance in weakly convex optimization problems.
J. Glob. Optim., 2021
J. Comput. Appl. Math., 2021
2020
A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems.
J. Glob. Optim., 2020
Solving policy design problems: Alternating direction method of multipliers-based methods for structured inverse variational inequalities.
Eur. J. Oper. Res., 2020
Asia Pac. J. Oper. Res., 2020
2019
A tri-level optimization model for a private road competition problem with traffic equilibrium constraints.
Eur. J. Oper. Res., 2019
2017
J. Comput. Appl. Math., 2017
On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function.
Comput. Optim. Appl., 2017
2015
Int. J. Comput. Math., 2015
2014
On the <i>O</i>(1/<i>t</i>) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators.
Comput. Optim. Appl., 2014
2013
J. Glob. Optim., 2013
Comput. Optim. Appl., 2013