#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2005

2017

- This year (2)
- Last 5 years (5)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Wenbao Ai, Shuzhong Zhang
- 2005

In this paper we propose a new class of primal-dual path-following interior point algorithms for solving monotone linear complementarity problems. At each iteration, the method would select a target on the central path with a large update from the current iterate, and then the Newton method is used to get the search directions, followed by adaptively… (More)

- Wenbao Ai, Yongwei Huang, Shuzhong Zhang
- Math. Program.
- 2011

In this paper, we present several new rank-one decomposition theorems for Hermitian positive semidefinite matrices, which generalize our previous results in Huang and Zhang (Math Oper Res 32(3):758–768, 2007), Ai and Zhang (SIAM J Optim 19(4):1735–1756, 2009). The new matrix rank-one decomposition theorems appear to have wide applications in theory as well… (More)

- Wenbao Ai, Shuzhong Zhang
- SIAM Journal on Optimization
- 2009

In this paper we consider the problem of minimizing a nonconvex quadratic function, subject to two quadratic inequality constraints. As an application, such quadratic program plays an important role in the trust region method for nonlinear optimization; such problem is known as the CDT subproblem in the literature. The Lagrangian dual of the CDT subproblem… (More)

- Wenbao Ai, Yongwei Huang, Shuzhong Zhang
- Math. Oper. Res.
- 2008

In this paper we present a polynomial-time procedure to find a low rank solution for a system of Linear Matrix Inequalities (LMI). The existence of such a low rank solution was shown in AuYeung and Poon [1] and Barvinok [3]. In Au-Yeung and Poon’s approach, an earlier unpublished manuscript of Bohnenblust [6] played an essential role. Both proofs in [1] and… (More)

- Wenbao Ai, Shuzhong Zhang
- SIAM Journal on Optimization
- 2005

In this paper we propose a new class of primal-dual path-following interior point algorithms for solving monotone linear complementarity problems. At each iteration, the method would select a target on the central path with a large update from the current iterate, and then the Newton method is used to get the search directions, followed by adaptively… (More)

- Tianping Shuai, Wenbao Ai
- Photonic Network Communications
- 2011

We study the problem of multicast routing and wavelength assignment (MC-RWA) in multi-hop optical WDM networks with respect to several target functions. Specially, we first study the MC-RWA problem under the target of minimize maximum hops, an efficient MC-RWA algorithm was proposed for that case. But for the objective of minimizing the total number of… (More)

- Yefang Li, Tianping Shuai, Wenbao Ai
- 2011 Fourth International Joint Conference on…
- 2011

In this paper we consider the minimum m-Connected k-Totally Dominating Set (m-k-CTDS) problem in disk graph. We present two centralized approximation algorithms for 1-k-CTDS and 2-k-CTDS problems with approximation ratios 1+ln \frac{K}{2}(k-1)+K+\frac{K}{k} and 1+\ln \frac{K}{2}(k-1)+K+\frac{3K}{k}, respectively, where K is 5 if… (More)

- Tianping Shuai, Wenbao Ai
- 2011 Fourth International Joint Conference on…
- 2011

Existing research has demonstrated that effective Routing and Wavelength Assignment (RWA) algorithm and wavelength conversion are two primary vehicles for improving the networks performance. In this paper, we consider the multicast routing and wavelength assignment problem(MC-RWA) in multi-hop optical WDM networks, where requests arrives one by one.… (More)

- Xing Yang, Wenbao Ai, Tianping Shuai, Daoben Li
- 2007 Second International Conference on…
- 2007

A fast decoding algorithm based on Semidefinite relaxation combined with cutting plane is proposed for the detection of Non-orthogonal frequency division multiplexing (NFDM) signals. It shows that maximum likelihood (ML) detection of NFDM signals can be transformed into a semidefinite programming problem by relaxing rank one constraint. In order to tighten… (More)