Jie Jiang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Jie Jiang has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Zhiping Chen
School of Mathematics and Statistics, Xi’an Jiaotong University, Xi’an, People’s Republic of China
6 shared publications - Hailin Sun
Key Laboratory of NSLSCS, Ministry of Education, Jiangsu International Joint Laboratory of BDMCA, School of Mathematical Sciences, Nanjing Normal University, Nanjing, China
4 shared publications - Xiaojun Chen
Department of Applied Mathematics, The Hong Kong Polytechnic University, Hong Kong
4 shared publications - Ilia Polian
Institute of Computer Science and Computer Engineering, University of Stuttgart, Stuttgart, Germany
3 shared publications - Sheng-Jie Li
College of Mathematics and Statistics, Chongqing University, Chongqing, People’s Republic of China
3 shared publications Xiaojun Chen
Department of Applied Mathematics, The Hong Kong Polytechnic University, Hong Kong, China
3 shared publications
Latest Publications
- 20 October 2026
- Published by Springer Nature in Computational Optimization and Applications
- p. 1-35
Discrete approximation for a class of stochastic hierarchical optimization problems
- 20 October 2026
- Published by Springer Nature in Computational Optimization and Applications
- p. 1-35
Discrete approximation for a class of stochastic hierarchical optimization problems
- 1 July 2026
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 210 (1)
Inexact Stochastic Forward-Backward Method for Two-stage Stochastic Mixed Variational Inequalities
- 1 July 2026
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 210 (1)
Inexact Stochastic Forward-Backward Method for Two-stage Stochastic Mixed Variational Inequalities
- Open Access
- 5 October 2024
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 101 (2) , 1-30
A Quasi-Newton Subspace Trust Region Algorithm for Nonmonotone Variational Inequalities in Adversarial Learning over Box Constraints
The first-order optimality condition of convexly constrained nonconvex nonconcave min-max optimization problems with box constraints formulates a nonmonotone variational inequality (VI), which is equivalent to a system of nonsmooth equations. In this paper, we propose a quasi-Newton subspace trust region (QNSTR) algorithm for the least squares problems defined by the smoothing approximation of nonsmooth equations. Based on the structure of the nonmonotone VI, we use an adaptive quasi-Newton formula to approximate the Hessian matrix and solve a low-dimensional strongly convex quadratic program with ellipse constraints in a subspace at each step of the QNSTR algorithm efficiently. We prove the global convergence of the QNSTR algorithm to an $$\epsilon $$ -first-order stationary point of the min-max optimization problem. Moreover, we present numerical results based on the QNSTR algorithm with different subspaces for a mixed generative adversarial networks in eye image segmentation using real data to show the efficiency and effectiveness of the QNSTR algorithm for solving large-scale min-max optimization problems.- 5 October 2024
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 101 (2) , 1-30
Open AccessA Quasi-Newton Subspace Trust Region Algorithm for Nonmonotone Variational Inequalities in Adversarial Learning over Box Constraints
The first-order optimality condition of convexly constrained nonconvex nonconcave min-max optimization problems with box constraints formulates a nonmonotone variational inequality (VI), which is equivalent to a system of nonsmooth equations. In this paper, we propose a quasi-Newton subspace trust region (QNSTR) algorithm for the least squares problems defined by the smoothing approximation of nonsmooth equations. Based on the structure of the nonmonotone VI, we use an adaptive quasi-Newton formula to approximate the Hessian matrix and solve a low-dimensional strongly convex quadratic program with ellipse constraints in a subspace at each step of the QNSTR algorithm efficiently. We prove the global convergence of the QNSTR algorithm to an $$\epsilon $$ -first-order stationary point of the min-max optimization problem. Moreover, we present numerical results based on the QNSTR algorithm with different subspaces for a mixed generative adversarial networks in eye image segmentation using real data to show the efficiency and effectiveness of the QNSTR algorithm for solving large-scale min-max optimization problems. - 3 September 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 34 (3) , 2917-2942
Data-Driven Distributionally Robust Multiproduct Pricing Problems under Pure Characteristics Demand Models
This paper considers a multiproduct pricing problem under pure characteristics demand models when the probability distribution of the random parameter in the problem is uncertain. We formulate this problem as a distributionally robust optimization (DRO) problem based on a constructive approach to estimating pure characteristics demand models with pricing by Pang, Su, and Lee. In this model, the consumers’ purchase decision is to maximize their utility. We show that the DRO problem is well-defined, and the objective function is upper semicontinuous by using an equivalent hierarchical form. We also use the data-driven approach to analyze the DRO problem when the ambiguity set, i.e., a set of probability distributions that contains some exact information of the underlying probability distribution, is given by a general moment-based case. We give convergence results as the data size tends to infinity and analyze the quantitative statistical robustness in view of the possible contamination of driven data. Furthermore, we use the Lagrange duality to reformulate the DRO problem as a mathematical program with complementarity constraints, and give a numerical procedure for finding a global solution of the DRO problem under certain specific settings. Finally, we report numerical results that validate the effectiveness and scalability of our approach for the distributionally robust multiproduct pricing problem.
- 3 September 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 34 (3) , 2917-2942
Data-Driven Distributionally Robust Multiproduct Pricing Problems under Pure Characteristics Demand Models
This paper considers a multiproduct pricing problem under pure characteristics demand models when the probability distribution of the random parameter in the problem is uncertain. We formulate this problem as a distributionally robust optimization (DRO) problem based on a constructive approach to estimating pure characteristics demand models with pricing by Pang, Su, and Lee. In this model, the consumers’ purchase decision is to maximize their utility. We show that the DRO problem is well-defined, and the objective function is upper semicontinuous by using an equivalent hierarchical form. We also use the data-driven approach to analyze the DRO problem when the ambiguity set, i.e., a set of probability distributions that contains some exact information of the underlying probability distribution, is given by a general moment-based case. We give convergence results as the data size tends to infinity and analyze the quantitative statistical robustness in view of the possible contamination of driven data. Furthermore, we use the Lagrange duality to reformulate the DRO problem as a mathematical program with complementarity constraints, and give a numerical procedure for finding a global solution of the DRO problem under certain specific settings. Finally, we report numerical results that validate the effectiveness and scalability of our approach for the distributionally robust multiproduct pricing problem.
- 30 July 2024
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 203 (1) , 227-255
Distributionally Robust Variational Inequalities: Relaxation, Quantification and Discretization
- 30 July 2024
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 203 (1) , 227-255
Distributionally Robust Variational Inequalities: Relaxation, Quantification and Discretization
- Open Access
A Quasi-Newton Subspace Trust Region Algorithm for nonmonotone variational inequalities in adversarial learning over box constraints
The first-order optimality condition of convexly constrained nonconvex nonconcave min-max optimization problems with box constraints formulates a nonmonotone variational inequality (VI), which is equivalent to a system of nonsmooth equations. In this paper, we propose a quasi-Newton subspace trust region (QNSTR) algorithm for the least squares problems defined by the smoothing approximation of nonsmooth equations. Based on the structure of the nonmonotone VI, we use an adaptive quasi-Newton formula to approximate the Hessian matrix and solve a low-dimensional strongly convex quadratic program with ellipse constraints in a subspace at each step of the QNSTR algorithm efficiently. We prove the global convergence of the QNSTR algorithm to an $ε$-first-order stationary point of the min-max optimization problem. Moreover, we present numerical results based on the QNSTR algorithm with different subspaces for a mixed generative adversarial networks in eye image segmentation using real data to show the efficiency and effectiveness of the QNSTR algorithm for solving large-scale min-max optimization problems.
Open AccessA Quasi-Newton Subspace Trust Region Algorithm for nonmonotone variational inequalities in adversarial learning over box constraints
The first-order optimality condition of convexly constrained nonconvex nonconcave min-max optimization problems with box constraints formulates a nonmonotone variational inequality (VI), which is equivalent to a system of nonsmooth equations. In this paper, we propose a quasi-Newton subspace trust region (QNSTR) algorithm for the least squares problems defined by the smoothing approximation of nonsmooth equations. Based on the structure of the nonmonotone VI, we use an adaptive quasi-Newton formula to approximate the Hessian matrix and solve a low-dimensional strongly convex quadratic program with ellipse constraints in a subspace at each step of the QNSTR algorithm efficiently. We prove the global convergence of the QNSTR algorithm to an $ε$-first-order stationary point of the min-max optimization problem. Moreover, we present numerical results based on the QNSTR algorithm with different subspaces for a mixed generative adversarial networks in eye image segmentation using real data to show the efficiency and effectiveness of the QNSTR algorithm for solving large-scale min-max optimization problems.
- 14 November 2023
- Published by Springer Nature in Journal of Global Optimization
- Vol. 89 (1) , 117-142
Discrete approximation for two-stage stochastic variational inequalities
- 14 November 2023
- Published by Springer Nature in Journal of Global Optimization
- Vol. 89 (1) , 117-142
Discrete approximation for two-stage stochastic variational inequalities
- 18 October 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 313 (2) , 616-627
Mathematical programs with distributionally robust chance constraints: Statistical robustness, discretization and reformulation
- 18 October 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 313 (2) , 616-627
Mathematical programs with distributionally robust chance constraints: Statistical robustness, discretization and reformulation
- 10 August 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Mathematics of Data Science
- Vol. 5 (3) , 693-722
Optimality Conditions for Nonsmooth Nonconvex-Nonconcave Min-Max Problems and Generative Adversarial Networks
This paper considers a class of nonsmooth nonconvex-nonconcave min-max problems in machine learning and games. We first provide sufficient conditions for the existence of global minimax points and local minimax points. Next, we establish the first-order and second-order optimality conditions for local minimax points by using directional derivatives. These conditions reduce to smooth min-max problems with Fréchet derivatives. We apply our theoretical results to generative adversarial networks (GANs) in which two neural networks contest with each other in a game. Examples are used to illustrate applications of the new theory for training GANs.
- 10 August 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Mathematics of Data Science
- Vol. 5 (3) , 693-722
Optimality Conditions for Nonsmooth Nonconvex-Nonconcave Min-Max Problems and Generative Adversarial Networks
This paper considers a class of nonsmooth nonconvex-nonconcave min-max problems in machine learning and games. We first provide sufficient conditions for the existence of global minimax points and local minimax points. Next, we establish the first-order and second-order optimality conditions for local minimax points by using directional derivatives. These conditions reduce to smooth min-max problems with Fréchet derivatives. We apply our theoretical results to generative adversarial networks (GANs) in which two neural networks contest with each other in a game. Examples are used to illustrate applications of the new theory for training GANs.
- 28 October 2022
- Published by Springer Nature in Journal of the Operations Research Society of China
- Vol. 12 (3) , 649-679
Discrete Approximation and Convergence Analysis for a Class of Decision-Dependent Two-Stage Stochastic Linear Programs
- 28 October 2022
- Published by Springer Nature in Journal of the Operations Research Society of China
- Vol. 12 (3) , 649-679
Discrete Approximation and Convergence Analysis for a Class of Decision-Dependent Two-Stage Stochastic Linear Programs