Yanjun Wang

Affiliations:
  • Shanghai University of Finance and Economics
  • Xi'an Jiaotong University


According to our database1, Yanjun Wang authored at least 18 papers between 2003 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Distributionally robust optimization problem with probabilistic envelope constraints over Wasserstein ball.
Comput. Optim. Appl., April, 2026

2024
Data-Driven Distributionally Robust Risk-Averse Two-Stage Stochastic Linear Programming over Wasserstein Ball.
J. Optim. Theory Appl., January, 2024

Distributionally robust joint chance-constrained programming with Wasserstein metric.
Optim. Methods Softw., 2024

2021
A time-consistent Benders decomposition method for multistage distributionally robust stochastic optimization with a scenario tree structure.
Comput. Optim. Appl., 2021

2016
Robust canonical duality theory for solving nonconvex programming problems under data uncertainty.
Math. Methods Oper. Res., 2016

2015
Duality and robust duality for special nonconvex homogeneous quadratic programming under certainty and uncertainty environment.
J. Glob. Optim., 2015

2010
Global optimality conditions for cubic minimization problem with box or binary constraints.
J. Glob. Optim., 2010

2009
Geometric Programming.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

A general algorithm for solving Generalized Geometric Programming with nonpositive degree of difficulty.
Comput. Optim. Appl., 2009

2008
Global optimization for special reverse convex programming.
Comput. Math. Appl., 2008

2007
Local saddle point and a class of convexification methods for nonconvex optimization problems.
J. Glob. Optim., 2007

2006
The model and algorithm for the optimization of the granularity distribution.
Appl. Math. Comput., 2006

2005
A branch-and-bound algorithm to globally solve the sum of several linear ratios.
Appl. Math. Comput., 2005

A deterministic global optimization algorithm for generalized geometric programming.
Appl. Math. Comput., 2005

A new pruning test for finding all global minimizers of nonsmooth functions.
Appl. Math. Comput., 2005

A new two-level linear relaxed bound method for geometric programming problems.
Appl. Math. Comput., 2005

2004
Global optimization of nonlinear sum of ratios problem.
Appl. Math. Comput., 2004

2003
Applications of interval arithmetic in non-smooth global optimization.
Appl. Math. Comput., 2003


  Loading...