Wenxun Xing

According to our database1, Wenxun Xing authored at least 28 papers between 2000 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Convergence rates of training deep neural networks via alternating minimization methods.
Optim. Lett., May, 2024

Globalized distributionally robust optimization based on samples.
J. Glob. Optim., April, 2024

A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem.
J. Glob. Optim., January, 2024

2023
A New Global Algorithm for Max-Cut Problem with Chordal Sparsity.
J. Optim. Theory Appl., May, 2023

ADMM Training Algorithms for Residual Networks: Convergence, Complexity and Parallel Training.
CoRR, 2023

2022
Fast computation of global solutions to the single-period unit commitment problem.
J. Comb. Optim., 2022

2021
Maximizing perturbation radii for robust convex quadratically constrained quadratic programs.
Eur. J. Oper. Res., 2021

2020
A gradient descent based algorithm for ℓ<sub><i>p</i></sub> minimization.
Eur. J. Oper. Res., 2020

2017
Conic approximation to quadratic optimization with linear complementarity constraints.
Comput. Optim. Appl., 2017

2016
A study on several combination problems of classic shop scheduling and shortest path.
Theor. Comput. Sci., 2016

2015
Parametric Lagrangian dual for the binary quadratic programming problem.
J. Glob. Optim., 2015

Canonical Dual Solutions to Quadratic Optimization over One Quadratic Constraint.
Asia Pac. J. Oper. Res., 2015

Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2013
Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme.
Eur. J. Oper. Res., 2013

2012
Canonical dual approach to solving the maximum cut problem.
J. Glob. Optim., 2012

A canonical dual approach for solving linearly constrained quadratic programs.
Eur. J. Oper. Res., 2012

2011
KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems.
SIAM J. Optim., 2011

2010
Two-group knapsack game.
Theor. Comput. Sci., 2010

An improved lower bound and approximation algorithm for binary constrained quadratic programming problem.
J. Glob. Optim., 2010

Worst-case analysis for on-line service policies.
J. Comb. Optim., 2010

2009
On-line service scheduling.
J. Sched., 2009

Global optimization for a class of fractional programming problems.
J. Glob. Optim., 2009

A successive approximation algorithm for the multiple knapsack problem.
J. Comb. Optim., 2009

2008
Performance of service policies in a specialized service system with parallel servers.
Ann. Oper. Res., 2008

2005
No-wait flexible flowshop scheduling with no-idle machines.
Oper. Res. Lett., 2005

2002
A bin packing problem with over-sized items.
Oper. Res. Lett., 2002

Algorithms for budget-constrained survivable topology design.
Proceedings of the IEEE International Conference on Communications, 2002

2000
Parallel machine scheduling with splitting jobs.
Discret. Appl. Math., 2000


  Loading...