Jie Sun
According to our database^{1},
Jie Sun
authored at least 82 papers
between 1989 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on zbmath.org

on orcid.org

on dnb.info
On csauthors.net:
Bibliography
2021
A timeconsistent Benders decomposition method for multistage distributionally robust stochastic optimization with a scenario tree structure.
Comput. Optim. Appl., 2021
2020
Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian.
SIAM J. Optim., 2020
Math. Program., 2020
Solving Lagrangian variational inequalities with applications to stochastic programming.
Math. Program., 2020
A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming.
Math. Program., 2020
A Novel Euler's ElasticaBased Segmentation Approach for Noisy Images Using the Progressive Hedging Algorithm.
J. Math. Imaging Vis., 2020
Robust multiperiod portfolio selection based on downside risk with asymmetrically distributed uncertainty set.
Eur. J. Oper. Res., 2020
A Model of Multistage RiskAverse Stochastic Optimization and its Solution by ScenarioBased Decomposition Algorithms.
Asia Pac. J. Oper. Res., 2020
Asia Pac. J. Oper. Res., 2020
2019
TwoStage Quadratic Games under Uncertainty and Their Solution by Progressive Hedging Algorithms.
SIAM J. Optim., 2019
Optim. Lett., 2019
Solving monotone stochastic variational inequalities and complementarity problems by progressive hedging.
Math. Program., 2019
A Novel Euler's Elastica based Segmentation Approach for Noisy Images via using the Progressive Hedging Algorithm.
CoRR, 2019
2018
IEEE Signal Process. Lett., 2018
The Convergent Generalized Central Paths for Linearly Constrained Convex Programming.
SIAM J. Optim., 2018
Maximum principle via Malliavin calculus for regularsingular stochastic differential games.
Optim. Lett., 2018
A semiinfinite programming approach to twostage stochastic linear programs with highorder moment constraints.
Optim. Lett., 2018
Math. Program., 2018
Math. Program., 2018
Ann. Oper. Res., 2018
2017
A Distributionally Robust Linear Receiver Design for MultiAccess SpaceTime Block Coded MIMO Systems.
IEEE Trans. Wirel. Commun., 2017
Eur. J. Oper. Res., 2017
2016
Optim. Methods Softw., 2016
Optim. Methods Softw., 2016
Proximal Analysis and the Minimal Time Function of a Class of Semilinear Control Systems.
J. Optim. Theory Appl., 2016
2014
Nonsmooth Algorithms and Nesterov's Smoothing Technique for Generalized FermatTorricelli Problems.
SIAM J. Optim., 2014
Eur. J. Oper. Res., 2014
Successive convex approximations to cardinalityconstrained convex programs: a piecewiselinear DC approach.
Comput. Optim. Appl., 2014
2013
Foreword: Special issue on the 8th International Conference on Optimization: Techniques and Applications.
Optim. Methods Softw., 2013
Establishing Nash equilibrium of the manufacturersupplier game in supply chain management.
J. Glob. Optim., 2013
2012
J. Glob. Optim., 2012
2011
Subdifferential properties of the minimal time function of linear control systems.
J. Glob. Optim., 2011
A smoothing sample average approximation method for stochastic optimization problems with CVaR risk measure.
Comput. Optim. Appl., 2011
2010
Preface: Special section on the 2nd International Conference on Nonlinear Programming with Applications.
Optim. Methods Softw., 2010
From CVaR to Uncertainty Set: Implications in Joint ChanceConstrained Optimization.
Oper. Res., 2010
A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs.
Eur. J. Oper. Res., 2010
2008
A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems.
SIAM J. Optim., 2008
The SC<sup>1</sup> property of the squared norm of the SOC FischerBurmeister function.
Oper. Res. Lett., 2008
The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming.
Math. Program., 2008
Math. Oper. Res., 2008
Eur. J. Oper. Res., 2008
2006
SIAM J. Optim., 2006
A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution.
Optim. Methods Softw., 2006
A note on the Lipschitz continuity of the gradient of the squared norm of the matrixvalued FischerBurmeister function.
Math. Program., 2006
Scenario Formulation of Stochastic Linear Programs and the Homogeneous SelfDual InteriorPoint Method.
INFORMS J. Comput., 2006
A Robust SQP Method for Mathematical Programs with Linear Complementarity Constraints.
Comput. Optim. Appl., 2006
2005
Strong Semismoothness of the FischerBurmeister SDC and SOC Complementarity Functions.
Math. Program., 2005
Math. Oper. Res., 2005
Eur. J. Oper. Res., 2005
Comput. Optim. Appl., 2005
2004
A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems.
SIAM J. Optim., 2004
SIAM J. Optim., 2004
Generalized stationary points and an interiorpoint method for mathematical programs with equilibrium constraints.
Math. Program., 2004
Math. Oper. Res., 2004
A New Decomposition Technique in Solving Multistage Stochastic Linear Programs by Infeasible Interior Point Methods.
J. Glob. Optim., 2004
An Analytic Center Cutting Plane Method for Solving SemiInfinite Variational Inequality Problems.
J. Glob. Optim., 2004
2003
Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems.
Math. Oper. Res., 2003
J. Glob. Optim., 2003
Comput. Optim. Appl., 2003
Complementarity Functions and Numerical Experiments on Some Smoothing Newton Methods for SecondOrderCone Complementarity Problems.
Comput. Optim. Appl., 2003
2002
Strong Semismoothness of Eigenvalues of Symmetric Matrices and Its Application to Inverse Eigenvalue Problems.
SIAM J. Numer. Anal., 2002
A MultipleCut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems.
SIAM J. Optim., 2002
Math. Oper. Res., 2002
Math. Oper. Res., 2002
J. Comb. Optim., 2002
2001
Eur. J. Oper. Res., 2001
Ann. Oper. Res., 2001
Ann. Oper. Res., 2001
2000
A Polynomial Cutting Surfaces Algorithm for the Convex Feasibility Problem Defined by SelfConcordant Inequalities.
Comput. Optim. Appl., 2000
1999
On the Rate of Local Convergence of HighOrderInfeasiblePathFollowing Algorithms for P*Linear Complementarity Problems.
Comput. Optim. Appl., 1999
1998
An Analytic Center Based Column Generation Algorithm for Convex Quadratic Feasibility Problems.
SIAM J. Optim., 1998
Global Linear and Local Quadratic Convergence of a LongStep AdaptiveMode Interior Point Method for Some Monotone Variational Inequality Problems.
SIAM J. Optim., 1998
1996
Math. Program., 1996
Comput. Oper. Res., 1996
Ann. Oper. Res., 1996
1994
Math. Program., 1994
1993
A convergence proof for an affinescaling algorithm for convex quadratic programming without nondegeneracy assumptions.
Math. Program., 1993
Math. Program., 1993
1992
An interior point algorithm of O(Quadrat Root(m) absolute (ln epsilon)) iterations for Cconvex programming.
Math. Program., 1992
1991
Math. Program., 1991
1990
An Algorithm for Convex Quadratic Programming That Requires <i>O</i>(<i>n</i><sup>3.5</sup><i>L</i>) Arithmetic Operations.
Math. Oper. Res., 1990
1989
Networks, 1989