Currently displaying 1 – 5 of 5

Showing per page

Order by Relevance | Title | Year of publication

Inexact Newton-type method for solving large-scale absolute value equation A x - | x | = b

Jingyong Tang — 2024

Applications of Mathematics

Newton-type methods have been successfully applied to solve the absolute value equation A x - | x | = b (denoted by AVE). This class of methods usually solves a system of linear equations exactly in each iteration. However, for large-scale AVEs, solving the corresponding system exactly may be expensive. In this paper, we propose an inexact Newton-type method for solving the AVE. In each iteration, the proposed method solves the corresponding system only approximately. Moreover, it adopts a new line search technique,...

Smoothing functions and algorithm for nonsymmetric circular cone complementarity problems

Jingyong TangYuefen Chen — 2022

Applications of Mathematics

There has been much interest in studying symmetric cone complementarity problems. In this paper, we study the circular cone complementarity problem (denoted by CCCP) which is a type of nonsymmetric cone complementarity problem. We first construct two smoothing functions for the CCCP and show that they are all coercive and strong semismooth. Then we propose a smoothing algorithm to solve the CCCP. The proposed algorithm generates an infinite sequence such that the value of the merit function converges...

Analysis of a non-monotone smoothing-type algorithm for the second-order cone programming

Jingyong TangLi DongLiang FangLi Sun — 2015

Applications of Mathematics

The smoothing-type algorithm is a powerful tool for solving the second-order cone programming (SOCP), which is in general designed based on a monotone line search. In this paper, we propose a smoothing-type algorithm for solving the SOCP with a non-monotone line search. By using the theory of Euclidean Jordan algebras, we prove that the proposed algorithm is globally and locally quadratically convergent under suitable assumptions. The preliminary numerical results are also reported which indicate...

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)