The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The article contains no abstract
It is proved that a radical class of lattice-ordered groups has exactly one cover if and only if it is an intersection of some -complement radical class and the big atom over .
The article contains no abstract
In this paper we propose a primal-dual interior-point algorithm for
convex quadratic semidefinite optimization problem. The search
direction of algorithm is defined in terms of a matrix function and
the iteration is generated by full-Newton step. Furthermore, we
derive the iteration bound for the algorithm with small-update
method, namely, ( log ), which is
best-known bound so far.
Download Results (CSV)