A QP-Free Algorithm for Finite Minimax Problems

Joint Authors

Han, Daolan
Jian, Jinbao
Zhang, Qinfeng

Source

Abstract and Applied Analysis

Issue

Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-9, 9 p.

Publisher

Hindawi Publishing Corporation

Publication Date

2014-06-24

Country of Publication

Egypt

No. of Pages

9

Main Subjects

Mathematics

Abstract EN

The nonlinear minimax problems without constraints are discussed.

Due to the expensive computation for solving QP subproblems with inequality constraints of SQP algorithms, in this paper, a QP-free algorithm which is also called sequential systems of linear equations algorithm is presented.

At each iteration, only two systems of linear equations with the same coefficient matrix need to be solved, and the dimension of each subproblem is not of full dimension.

The proposed algorithm does not need any penalty parameters and barrier parameters, and it has small computation cost.

In addition, the parameters in the proposed algorithm are few, and the stability of the algorithm is well.

Convergence property is described and some numerical results are provided.

American Psychological Association (APA)

Han, Daolan& Jian, Jinbao& Zhang, Qinfeng. 2014. A QP-Free Algorithm for Finite Minimax Problems. Abstract and Applied Analysis،Vol. 2014, no. 2014, pp.1-9.
https://search.emarefa.net/detail/BIM-1013934

Modern Language Association (MLA)

Han, Daolan…[et al.]. A QP-Free Algorithm for Finite Minimax Problems. Abstract and Applied Analysis No. 2014 (2014), pp.1-9.
https://search.emarefa.net/detail/BIM-1013934

American Medical Association (AMA)

Han, Daolan& Jian, Jinbao& Zhang, Qinfeng. A QP-Free Algorithm for Finite Minimax Problems. Abstract and Applied Analysis. 2014. Vol. 2014, no. 2014, pp.1-9.
https://search.emarefa.net/detail/BIM-1013934

Data Type

Journal Articles

Language

English

Notes

Includes bibliographical references

Record ID

BIM-1013934