AN EFFICIENT MATRIX SPLITTING METHOD FOR THE SECOND-ORDER CONE COMPLEMENTARITY PROBLEM (original) (raw)
Related papers
A proximal gradient descent method for the extended second-order cone linear complementarity problem
Journal of Mathematical Analysis and Applications, 2010
We consider an extended second-order cone linear complementarity problem (SOCLCP), including the generalized SOCLCP, the horizontal SOCLCP, the vertical SOCLCP, and the mixed SOCLCP as special cases. In this paper, we present some simple second-order cone constrained and unconstrained reformulation problems, and under mild conditions prove the equivalence between the stationary points of these optimization problems and the solutions of the extended SOCLCP. Particularly, we develop a proximal gradient descent method for solving the second-order cone constrained problems. This method is very simple and at each iteration makes only one Euclidean projection onto second-order cones. We establish global convergence and, under a local Lipschitzian error bound assumption, linear rate of convergence. Numerical comparisons are made with the limited-memory BFGS method for the unconstrained reformulations, which verify the effectiveness of the proposed method.
A descent method for a reformulation of the second-order cone complementarity problem
Journal of Computational and Applied Mathematics, 2008
Analogous to the nonlinear complementarity problem (NCP) and the semidefinite complementarity problem (SDCP), a popular approach to solving the secondorder cone complementarity problem (SOCCP) is to reformulate it as an unconstrained minimization of a certain merit function over IR n . In this paper, we present a descent method for solving the unconstrained minimization reformulation of the SOCCP which is based on the Fischer-Burmeister merit function associated with second-order cone [4], and prove its global convergence. Particularly, we compare the numerical performance of the method for the symmetric affine SOCCP generated randomly with the Fischer-Burmeister merit function approach [4]. The comparison results indicate that, if a scaling strategy is imposed on the test problem, the descent method proposed is comparable with the merit function approach in the CPU time for solving test problems although the former may require more function evaluations.
Numerical Mathematics: Theory, Methods and Applications
Linear complementarity problems have drawn considerable attention in recent years due to their wide applications. In this article, we introduce the two-step two-sweep modulus-based matrix splitting (TSTM) iteration method and two-sweep modulus-based matrix splitting type II (TM II) iteration method which are a combination of the two-step modulus-based method and the two-sweep modulus-based method, as two more effective ways to solve the linear complementarity problems. The convergence behavior of these methods is discussed when the system matrix is either a positive-definite or an H +-matrix. Finally, numerical experiments are given to show the efficiency of our proposed methods.
An iterative two-step algorithm for linear complementarity problems
Numerische Mathematik, 1994
We propose an algorithm for the numerical solution of large-scale symmetric positive-definite linear complementarity problems. Each step of the algorithm combines an application of the successive overrelaxation method with projection (to determine an approximation of the optimal active set) with the preconditioned conjugate gradient method (to solve the reduced residual systems of linear equations). Convergence of the iterates to the solution is proved. In the experimental part we compare the efficiency of the algorithm with several other methods. As test example we consider the obstacle problem with different obstacles. For problems of dimension up to 24 000 variables, the algorithm finds the solution in less then 7 iterations, where each iteration requires about 10 matrix-vector multiplications.
SOR-Like Methods for Non-Hermitian Positive Definite Linear Complementarity Problems
2013
Many problems in various scientific computing, operations research, management science and engineering areas can lead to the solution of a linear complementarity problem (LCP ). This paper provides the efficient iterative algorithm for the large sparse Non-Hermitian positive definite systems of LCP , based on the splitting of the coefficient matrix and fixed-point principle. Also, the global convergence properties of the proposed method have been analyzed. Numerical results show the applicability of our method.
Numerical Algorithms, 2016
The Linear Complementarity Problem (LCP), with an H + −matrix coefficient, is solved by using the new "(Projected) Matrix Analogue of the AOR (MAAOR)" iterative method; this new method constitutes an extension of the "Generalized AOR (GAOR)" iterative method. In this work two sets of convergence intervals of the parameters involved are determined by the theories of "Perron-Frobenius" and of "Regular Splittings". It is shown that the intervals in question are better than any similar convergence intervals found so far by similar iterative methods. A deeper analysis reveals that the "best" values of the parameters involved are those of the (projected) scalar Gauss-Seidel iterative method. A theoretical comparison of the "best" (projected) Gauss-Seidel and the "best" modulus-based splitting Gauss-Seidel method is in favor of the former method. A number of numerical examples support most of our theoretical findings.
2014
A full Nesterov-Todd (NT) step infeasible interior-point algorithm is proposed for solving monotone linear complementarity problems over symmetric cones by using Euclidean Jordan algebra. Two types of full NT-steps are used, feasibility steps and centering steps. The algorithm starts from strictly feasible iterates of a per- turbed problem, and, using the central path and feasibility steps, nds strictly feasible iterates for the next perturbed problem. By using centering steps for the new perturbed problem, strictly fea- sible iterates are obtained to be close enough to the central path of the new perturbed problem. The starting point depends on two positive numbersp andd. The algorithm terminates either by nding an ϵ-solution or detecting that the symmetric cone linear complementarity problem has no optimal solution with vanishing duality gap satisfying a condition in terms ofp andd. The it- eration bound coincides with the best known bound for infeasible interior-point methods. Ke...
A least-square semismooth Newton method for the second-order cone complementarity problem
Optimization Methods and Software, 2011
We present a nonlinear least-square formulation for the second-order cone complementarity problem based on the Fischer-Burmeister (FB) function and the plus function. This formulation has two-fold advantages. First, the operator involved in the over-determined system of equations inherits the favourable properties of the FB function for local convergence, for example, the (strong) semi-smoothness; second, the natural merit function of the over-determined system of equations share all the nice features of the class of merit functions f YF studied in [J.-S. Chen and P. Tseng, An unconstrained smooth minimization reformulation of the second-order cone complementarity problem, Math. Program. 104 (2005), pp. 293-327] for global convergence. We propose a semi-smooth Levenberg-Marquardt method to solve the arising over-determined system of equations, and establish the global and local convergence results. Among others, the superlinear (quadratic) rate of convergence is obtained under strict complementarity of the solution and a local error bound assumption, respectively. Numerical results verify the advantages of the least-square reformulation for difficult problems.
Abstract and Applied Analysis
The linear complementarity problem is receiving a lot of attention and has been studied extensively. Recently, El foutayeni et al. have contributed many works that aim to solve this mysterious problem. However, many results exist and give good approximations of the linear complementarity problem solutions. The major drawback of many existing methods resides in the fact that, for large systems, they require a large number of operations during each iteration; also, they consume large amounts of memory and computation time. This is the reason which drives us to create an algorithm with a finite number of steps to solve this kind of problem with a reduced number of iterations compared to existing methods. In addition, we consider a new class of matrices called the E-matrix.
A new approach for the modulus-based matrix splitting algorithms
IEEE Access
We investigate the modulus-based matrix splitting iteration algorithms for solving the linear complementarity problems (LCPs) and propose a new model to solve it. The structure of the new model is straightforward and can be extended to other issues of type of complementarity. Convergence analysis of the new approach for the symmetric positive definite matrix is also discussed. Numerical results of the proposed approach are compared with the existing algorithms to show its efficiency.