Jie Sun
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
Research Subjects
Jie Sun has a total of 166 co-authors. Here are the top co-authors by number of shared publications:
- Defeng Sun
Department of Applied Mathematics, The Hong Kong Polytechnic University, Hong Kong, China
11 shared publications - Min Zhang
School of Mathematics and Information Science, Guangzhou University, Guangzhou 510006, China
8 shared publications - Honglei Xu
School of Electrical Engineering, Computing and Mathematical Sciences, Curtin University, Perth, Australia
6 shared publications Kok Lay Teo
6 shared publications- Qiang Yao
School of Finance and Statistics East China Normal University 200241 Shanghai China
6 shared publications - Xin-Wei Liu
Institute of Mathematics, Hebei University of Technology, Tianjin, China
6 shared publications
Latest Publications
- Open Access
- 14 January 2025
- Published by Science China Press., Co. Ltd. in SCIENTIA SINICA Mathematica
- Vol. 55 (2) , 361
A Benders decomposition approximate dynamic method for distributionally robust multistage linear stochastic programming with nondiscrete distributions
本文对包含非离散分布的一类分布鲁棒多阶段随机线性规划问题提出了一种基于Benders分解的动态逼近方法。在随机因素按阶段独立、分布模糊集由矩约束给出等条件下,利用Benders分解构建了各阶段决策函数的近似函数,从而将多阶段决策问题近似分解为一系列具有锥约束形式的凸优化子问题。为分析算法的收敛性,我们构建了一个新的基于变分分析的收敛性分析框架,并证明了算法构建的近似问题对原问题具有上图收敛性。最后通过数值实验展示了算法的有效性。
- 14 January 2025
- Published by Science China Press., Co. Ltd. in SCIENTIA SINICA Mathematica
- Vol. 55 (2) , 361
Open AccessA Benders decomposition approximate dynamic method for distributionally robust multistage linear stochastic programming with nondiscrete distributions
本文对包含非离散分布的一类分布鲁棒多阶段随机线性规划问题提出了一种基于Benders分解的动态逼近方法。在随机因素按阶段独立、分布模糊集由矩约束给出等条件下,利用Benders分解构建了各阶段决策函数的近似函数,从而将多阶段决策问题近似分解为一系列具有锥约束形式的凸优化子问题。为分析算法的收敛性,我们构建了一个新的基于变分分析的收敛性分析框架,并证明了算法构建的近似问题对原问题具有上图收敛性。最后通过数值实验展示了算法的有效性。
- Open Access
A matrix-free interior point continuous trajectory for linearly constrained convex programming
Interior point methods for solving linearly constrained convex programming involve a variable projection matrix at each iteration to deal with the linear constraints. This matrix often becomes ill-conditioned near the boundary of the feasible region that results in wrong search directions and extra computational cost. A matrix-free interior point augmented Lagrangian continuous trajectory is therefore proposed and studied for linearly constrained convex programming. A closely related ordinary differential equation (ODE) system is formulated. In this ODE system, the variable projection matrix is no longer needed. By only assuming the existence of an optimal solution, we show that, starting from any interior feasible point, (i) the interior point augmented Lagrangian continuous trajectory is convergent; and (ii) the limit point is indeed an optimal solution of the original optimization problem. Moreover, with the addition of the strictly complementarity condition, we show that the associated Lagrange multiplier converges to an optimal solution of the Lagrangian dual problem. Based on the studied ODE system, several possible search directions for discrete algorithms are proposed and discussed.
Open AccessA matrix-free interior point continuous trajectory for linearly constrained convex programming
Interior point methods for solving linearly constrained convex programming involve a variable projection matrix at each iteration to deal with the linear constraints. This matrix often becomes ill-conditioned near the boundary of the feasible region that results in wrong search directions and extra computational cost. A matrix-free interior point augmented Lagrangian continuous trajectory is therefore proposed and studied for linearly constrained convex programming. A closely related ordinary differential equation (ODE) system is formulated. In this ODE system, the variable projection matrix is no longer needed. By only assuming the existence of an optimal solution, we show that, starting from any interior feasible point, (i) the interior point augmented Lagrangian continuous trajectory is convergent; and (ii) the limit point is indeed an optimal solution of the original optimization problem. Moreover, with the addition of the strictly complementarity condition, we show that the associated Lagrange multiplier converges to an optimal solution of the Lagrangian dual problem. Based on the studied ODE system, several possible search directions for discrete algorithms are proposed and discussed.
- 1 October 2024
- Published by Emerald Publishing in China Finance Review International
- Vol. 14 (3) , 549-594
A robust financing theory of ICOs under demand uncertainty of products of token platforms
Purpose: The market products produced by Initial Coin Offerings (ICO) platforms are often relatively new and have no previous transaction records and therefore are hard to estimate for its demand. The purpose is to study the impacts of the degree of ambiguity aversion of entrepreneurs to demand uncertainty on the ICO financing ratio, the optimal expected output, the optimal efforts and the token price.Design/methodology/approach: In an optimal ICO design, we introduce demand uncertainty of the product and establish a robust optimization method to solve the ICO optimal design. We compare ICO financing and the general venture capital (VC) financing model. We analyze the impact of demand uncertainty on the optimal ICO financing ratio.Findings: Findings include that the ICO financing ratio is positively related to the degree of ambiguity aversion, the token price is negatively related to the degree of ambiguity aversion and the “ambiguity premium” exists in the ICO market, the optimal effort levels are negatively related with the ICO financing ratio, but positively related with token price, and in the environment of high production cost, VC financing is not as good as ICO financing.Originality/value: We develop a robust ICO financing model by assuming that the entrepreneur is ambiguity aversive to the demand uncertainty. Analyze the impact of the degree of ambiguity aversion on the ICO financing ratio in theory and find that the entrepreneur can raise funds with the higher ICO token ratio when she has a larger degree of ambiguity aversion to the demand uncertainty. Extend the impact analysis of the degree of ambiguity aversion on the expected token price and find a negative relationship between the expected token price and the degree of ambiguity aversion of the entrepreneur to the demand uncertainty.
- 1 October 2024
- Published by Emerald Publishing in China Finance Review International
- Vol. 14 (3) , 549-594
A robust financing theory of ICOs under demand uncertainty of products of token platforms
Purpose: The market products produced by Initial Coin Offerings (ICO) platforms are often relatively new and have no previous transaction records and therefore are hard to estimate for its demand. The purpose is to study the impacts of the degree of ambiguity aversion of entrepreneurs to demand uncertainty on the ICO financing ratio, the optimal expected output, the optimal efforts and the token price.Design/methodology/approach: In an optimal ICO design, we introduce demand uncertainty of the product and establish a robust optimization method to solve the ICO optimal design. We compare ICO financing and the general venture capital (VC) financing model. We analyze the impact of demand uncertainty on the optimal ICO financing ratio.Findings: Findings include that the ICO financing ratio is positively related to the degree of ambiguity aversion, the token price is negatively related to the degree of ambiguity aversion and the “ambiguity premium” exists in the ICO market, the optimal effort levels are negatively related with the ICO financing ratio, but positively related with token price, and in the environment of high production cost, VC financing is not as good as ICO financing.Originality/value: We develop a robust ICO financing model by assuming that the entrepreneur is ambiguity aversive to the demand uncertainty. Analyze the impact of the degree of ambiguity aversion on the ICO financing ratio in theory and find that the entrepreneur can raise funds with the higher ICO token ratio when she has a larger degree of ambiguity aversion to the demand uncertainty. Extend the impact analysis of the degree of ambiguity aversion on the expected token price and find a negative relationship between the expected token price and the degree of ambiguity aversion of the entrepreneur to the demand uncertainty.
- 26 September 2024
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 203 (1) , 960-984
Risk-Averse Optimal Control Model Under Uncertainty and Its Modified Progressive Hedging Algorithm
- 26 September 2024
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 203 (1) , 960-984
Risk-Averse Optimal Control Model Under Uncertainty and Its Modified Progressive Hedging Algorithm
- 2 September 2023
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 199 (1) , 363-391
On Multistage Pseudomonotone Stochastic Variational Inequalities
- 2 September 2023
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 199 (1) , 363-391
On Multistage Pseudomonotone Stochastic Variational Inequalities
- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 19 (3) , 1813-1826
An inertial triple-projection algorithm for solving the split feasibility problem
This paper proposes a new inertial triple-projection algorithm for solving the split feasibility problem. The process of projections is divided into three parts. Each part adopts a different variable stepsize to obtain its projection point, which is different from the existing extragradient methods. Flexible rules are employed for selecting the stepsizes and the inertial technique is used for improving the convergence. Convergence results are proven. Numerical experiments show that the proposed method converges more quickly than the general CQ algorithm.
- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 19 (3) , 1813-1826
An inertial triple-projection algorithm for solving the split feasibility problem
This paper proposes a new inertial triple-projection algorithm for solving the split feasibility problem. The process of projections is divided into three parts. Each part adopts a different variable stepsize to obtain its projection point, which is different from the existing extragradient methods. Flexible rules are employed for selecting the stepsizes and the inertial technique is used for improving the convergence. Convergence results are proven. Numerical experiments show that the proposed method converges more quickly than the general CQ algorithm.
- 20 December 2022
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 92 (341) , 1301-1330
A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
We introduce a twice differentiable augmented Lagrangian for nonlinear optimization with general inequality constraints and show that a strict local minimizer of the original problem is an approximate strict local solution of the augmented Lagrangian. A novel augmented Lagrangian method of multipliers (ALM) is then presented. Our method is originated from a generalization of the Hestenes-Powell augmented Lagrangian, and is a combination of the augmented Lagrangian and the interior-point technique. It shares a similar algorithmic framework with existing ALMs for optimization with inequality constraints, but it can use the second derivatives and does not depend on projections on the set of inequality constraints. In each iteration, our method solves a twice continuously differentiable unconstrained optimization subproblem on primal variables. The dual iterates, penalty and smoothing parameters are updated adaptively. The global and local convergence are analyzed. Without assuming any constraint qualification, it is proved that the proposed method has strong global convergence. The method may converge to either a Karush-Kuhn-Tucker (KKT) point or a singular stationary point when the converging point is a minimizer. It may also converge to an infeasible stationary point of nonlinear program when the problem is infeasible. Furthermore, our method is capable of rapidly detecting the possible infeasibility of the solved problem. Under suitable conditions, it is locally linearly convergent to the KKT point, which is consistent with ALMs for optimization with equality constraints. The preliminary numerical experiments on some small benchmark test problems demonstrate our theoretical results.
- 20 December 2022
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 92 (341) , 1301-1330
A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
We introduce a twice differentiable augmented Lagrangian for nonlinear optimization with general inequality constraints and show that a strict local minimizer of the original problem is an approximate strict local solution of the augmented Lagrangian. A novel augmented Lagrangian method of multipliers (ALM) is then presented. Our method is originated from a generalization of the Hestenes-Powell augmented Lagrangian, and is a combination of the augmented Lagrangian and the interior-point technique. It shares a similar algorithmic framework with existing ALMs for optimization with inequality constraints, but it can use the second derivatives and does not depend on projections on the set of inequality constraints. In each iteration, our method solves a twice continuously differentiable unconstrained optimization subproblem on primal variables. The dual iterates, penalty and smoothing parameters are updated adaptively. The global and local convergence are analyzed. Without assuming any constraint qualification, it is proved that the proposed method has strong global convergence. The method may converge to either a Karush-Kuhn-Tucker (KKT) point or a singular stationary point when the converging point is a minimizer. It may also converge to an infeasible stationary point of nonlinear program when the problem is infeasible. Furthermore, our method is capable of rapidly detecting the possible infeasibility of the solved problem. Under suitable conditions, it is locally linearly convergent to the KKT point, which is consistent with ALMs for optimization with equality constraints. The preliminary numerical experiments on some small benchmark test problems demonstrate our theoretical results.
- 21 October 2022
- Published by Springer Nature in Journal of the Operations Research Society of China
- Vol. 11 (2) , 277-307
A Mini-Batch Proximal Stochastic Recursive Gradient Algorithm with Diagonal Barzilai–Borwein Stepsize
- 21 October 2022
- Published by Springer Nature in Journal of the Operations Research Society of China
- Vol. 11 (2) , 277-307
A Mini-Batch Proximal Stochastic Recursive Gradient Algorithm with Diagonal Barzilai–Borwein Stepsize
- 8 February 2022
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 90 (3) , 1-31
An Interior Point Parameterized Central Path Following Algorithm for Linearly Constrained Convex Programming
- 8 February 2022
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 90 (3) , 1-31
An Interior Point Parameterized Central Path Following Algorithm for Linearly Constrained Convex Programming
- 6 January 2022
- Published by Taylor & Francis
- p. 213-235
A Study on Monotropic Piecewise Quadratic Programming
We explore a new model in mathematical programming in which a separable convex piecewise quadratic function is minimized subject to linear constraints. The discussion includes basic theories such as duality, optimality, boundedness of solutions, and parametric properties as well as some examples for applications. We also briefly review algorithms developed for this model.
- 6 January 2022
- Published by Taylor & Francis
- p. 213-235
A Study on Monotropic Piecewise Quadratic Programming
We explore a new model in mathematical programming in which a separable convex piecewise quadratic function is minimized subject to linear constraints. The discussion includes basic theories such as duality, optimality, boundedness of solutions, and parametric properties as well as some examples for applications. We also briefly review algorithms developed for this model.