activity
20182024
most citedChebyshev Center of the Intersection of Balls: Complexity, Relaxation and Approximation

1 citations · 1 across the 4 of their papers we have counts for

collaborators
Showing math.OCShow all

5 papers · 1 filter

math.OC2024

A polynomially solvable case of unconstrained (-1,1)-quadratic fractional optimization

Meijia Yang, Yong Xia

In this paper, we consider an unconstrained (-1,1)-quadratic fractional optimization in the following form: , where and , given by…

math.OC2024

Closing the duality gap of the generalized trace ratio problem

Meijia Yang, Yong Xia

The generalized trace ratio problem {\rm (GTRP)} is to maximize a quadratic fractional objective function in trace formulation over the Stiefel manifold. In this paper, based on a…

math.OC2021

Unifying Farkas lemma and S-lemma: new theory and applications in nonquadratic nonconvex optimization

Meijia Yang, Yong Xia, Shu Wang

We unify nonlinear Farkas lemma and S-lemma to a generalized alternative theorem for nonlinear nonconvex system. It provides fruitful applications in globally solving nonconvex non…

math.OC20191 cited

Chebyshev Center of the Intersection of Balls: Complexity, Relaxation and Approximation

Yong Xia, Meijia Yang, Shu Wang

We study the n-dimensional problem of finding the smallest ball enclosing the intersection of p given balls, the so-called Chebyshev center problem (CCB). It is a minimax optimizat…

math.OC2018

A fast algorithm for globally solving Tikhonov regularized total least squares problem

Yong Xia, Longfei Wang, Meijia Yang

The total least squares problem with the general Tikhonov regularization can be reformulated as a one-dimensional parametric minimization problem (PM), where each parameterized fun…