Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
By reviewing the Logarithmic–quadratic proximal (LQP) method, in this paper we suggest and analyze a new LQP alternating direction scheme for the separable constrained convex programming problem. The optimal step size along the descent direction is chosen to improve the efficiency of the new method. By making use of the LQP system of nonlinear equations, weaker conditions are presented to ensure the global convergence of the proposed method. We have also discussed some numerical results to illustrate the efficiency of the proposed method.