Zobrazeno 1 - 10
of 74
pro vyhledávání: '"Wenxun Xing"'
Publikováno v:
Journal of Nonlinear & Variational Analysis; 2024, Vol. 8 Issue 6, p831-853, 23p
Publikováno v:
Journal of Optimization Theory and Applications. 197:608-638
Publikováno v:
European Journal of Operational Research. 293:50-64
Under the assumption that uncertain coefficients corresponding to each constraint are perturbed in an ellipsoidal set, we consider the problem of maximizing the perturbation radius of the ellipsoidal set associated to a robust convex quadratically co
Publikováno v:
European Journal of Operational Research. 283:47-56
In this paper, we study the linearly constrained lp minimization problem with p ∈ (0, 1). Unlike those known works in the literature that propose solving relaxed ϵ-KKT conditions, we introduce a scaled KKT condition without involving any relaxatio
Autor:
Wenxun Xing, Ruotian Gao
Publikováno v:
Journal of Industrial & Management Optimization. 16:2029-2044
Sensitivity analysis is applied to the robust linear programming problem in this paper. The coefficients of the linear program are assumed to be perturbed in three perturbation manners within ellipsoidal sets. Our robust sensitivity analysis is to ca
Publikováno v:
Journal of Combinatorial Optimization. 44:1511-1536
The single-period unit commitment problem has significant applications in electricity markets. An efficient global algorithm not only provides the optimal schedule that achieves the lowest cost, but also plays an important role for deriving the marke
Publikováno v:
Journal of Industrial & Management Optimization. 15:1677-1699
In this paper, we study an extended trust region subproblem (eTRS) in which the unit ball intersects with \begin{document}$m$\end{document} linear inequality constraints. In the literature, Burer et al. proved that an SOC-SDP relaxation (SOCSDPr) of
Publikováno v:
Journal of Industrial & Management Optimization. 14:625-636
Quadratic programs with complementarity constraints (QPCC) are NP-hard due to the nonconvexity of complementarity relation between the pairs of nonnegative variables. Most of the existing solvers are capable of solving QPCC by finding stationary solu
Publikováno v:
Journal of Industrial & Management Optimization. 13:1307-1328
Publikováno v:
Journal of Industrial & Management Optimization. 13:1291-1305
A special type of multi-variate polynomial of degree 4, called the double well potential function, is studied. It is derived from a discrete approximation of the generalized Ginzburg-Landau functional, and we are interested in understanding its globa