Currently displaying 1 – 5 of 5

Showing per page

Order by Relevance | Title | Year of publication

A globally convergent non-interior point algorithm with full Newton step for second-order cone programming

Liang FangGuoping HeLi Sun — 2009

Applications of Mathematics

A non-interior point algorithm based on projection for second-order cone programming problems is proposed and analyzed. The main idea of the algorithm is that we cast the complementary equation in the primal-dual optimality conditions as a projection equation. By using this reformulation, we only need to solve a system of linear equations with the same coefficient matrix and compute two simple projections at each iteration, without performing any line search. This algorithm can start from an arbitrary...

An accurate active set Newton algorithm for large scale bound constrained optimization

Li SunGuoping HeYongli WangChangyin Zhou — 2011

Applications of Mathematics

A new algorithm for solving large scale bound constrained minimization problems is proposed. The algorithm is based on an accurate identification technique of the active set proposed by Facchinei, Fischer and Kanzow in 1998. A further division of the active set yields the global convergence of the new algorithm. In particular, the convergence rate is superlinear without requiring the strict complementarity assumption. Numerical tests demonstrate the efficiency and performance of the present strategy...

A smoothing Newton method for the second-order cone complementarity problem

Jingyong TangGuoping HeLi DongLiang FangJinchuan Zhou — 2013

Applications of Mathematics

In this paper we introduce a new smoothing function and show that it is coercive under suitable assumptions. Based on this new function, we propose a smoothing Newton method for solving the second-order cone complementarity problem (SOCCP). The proposed algorithm solves only one linear system of equations and performs only one line search at each iteration. It is shown that any accumulation point of the iteration sequence generated by the proposed algorithm is a solution to the SOCCP. Furthermore,...

A new one-step smoothing newton method for second-order cone programming

Jingyong TangGuoping HeLi DongLiang Fang — 2012

Applications of Mathematics

In this paper, we present a new one-step smoothing Newton method for solving the second-order cone programming (SOCP). Based on a new smoothing function of the well-known Fischer-Burmeister function, the SOCP is approximated by a family of parameterized smooth equations. Our algorithm solves only one system of linear equations and performs only one Armijo-type line search at each iteration. It can start from an arbitrary initial point and does not require the iterative points to be in the sets...

Page 1

Download Results (CSV)