Coffman et al. [Phys. Rev. A 61, 052306 (2000)] introduced the residual entanglement for three qubits. In this paper, we present the entanglement measure τ(ψ) for even n qubits; for odd n qubits, we propose the residual entanglement τ(i)(ψ) with respect to qubit i and the odd n-tangle R(ψ) by averaging the residual entanglement with respect to each qubit. In this paper, we show that these measures are LU-invariant, entanglement monotones, invariant under permutations of the qubits, and multiplicative in some cases.
25 September 2020 in Mathematical Problems in Engineering
A new hybrid PRPFR conjugate gradient method is presented in this paper, which is designed such that it owns sufficient descent property and trust region property. This method can be considered as a convex combination of the PRP method and the FR method while using the hyperplane projection technique. Under accelerated step length, the global convergence property is gained with some appropriate assumptions. Comparing with other methods, the numerical experiments show that the PRPFR method is more competitive for solving nonlinear equations and image restoration problems.
9 August 2017 in Journal of Inequalities and Applications
In this paper, a modified BFGS algorithm is proposed for unconstrained optimization. The proposed algorithm has the following properties: (i) a nonmonotone line search technique is used to obtain the step size $\alpha_{k}$ to improve the effectiveness of the algorithm; (ii) the algorithm possesses not only global convergence but also superlinear convergence for generally convex functions; (iii) the algorithm produces better numerical results than those of the normal BFGS method.
1 January 2018 in Mathematical Problems in Engineering
This paper gives a modified Hestenes and Stiefel (HS) conjugate gradient algorithm under the Yuan-Wei-Lu inexact line search technique for large-scale unconstrained optimization problems, where the proposed algorithm has the following properties: the new search direction possesses not only a sufficient descent property but also a trust region feature; the presented algorithm has global convergence for nonconvex functions; the numerical experiment showed that the new algorithm is more effective than similar algorithms.
A limited memory BFGS (L-BFGS) algorithm is presented for solving large-scale symmetric nonlinear equations, where a line search technique without derivative information is used. The global convergence of the proposed algorithm is established under some suitable conditions. Numerical results show that the given method is competitive to those of the normal BFGS methods.