The generalized trace ratio problem (GTRP) is to maximize the quotient over the Stiefel manifold. We establish the first-order necessary and sufficient optimality conditions for the global maximizer. Based on the classical second-order necessary optimality condition, we prove that GTRP has no local non-global maximizer. Finally we reveal the hidden convexity property of GTRP by applying the convex hull representation of the orthogonal similarity set.
2 August 2019 in International Journal of Computer Mathematics
Recently, a strictly contractive Peaceman–Rachford splitting method with logarithmic-quadratic proximal regularization (SPRSM-LQP) was proposed for solving two-block separable convex minimization model. In practical applications, however, the smaller step-size should be strongly avoided. So we actually have the desire of seeking larger step-size whenever possible in order to accelerate the numerical performance. In this paper, we combine Fortin and Glowinski's accelerating techniques with the SPRSM-LQP. Thus a new algorithm with larger step-size is proposed. Under the same assumptions as the SPRSM-LQP, we establish the global convergence of its larger step-size counterpart. Moreover, preliminary numerical results show that the proposed method on a traffic network equilibrium problem is reliable and more efficient with larger step-size.
We study the total least squares (TLS) with a parametric Tikhonov-like regularization. We relax it to a semidefinite programming (SDP) problem and establish a sufficient condition to guarantee the tightness of the SDP relaxation. This special-structured SDP relaxation is further reformulated as a univariate maximization and then solved by the bisection method. Numerical results demonstrate that the bisection algorithm highly outperforms the SDP solver SeDuMi. Finally, based on the newly proposed (SDP), we propose a new SDP relaxation for (TLS) with canonical Tikhonov regularization and then employ an outer approximation scheme to solve this SDP relaxation.