A globally convergent filter-type trust region method for semidefinite programming (Q1955230): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q58912095, #quickstatements; #temporary_batch_1705829395789 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58912095 / rank | |||
Normal rank |
Revision as of 11:39, 21 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A globally convergent filter-type trust region method for semidefinite programming |
scientific article |
Statements
A globally convergent filter-type trust region method for semidefinite programming (English)
0 references
11 June 2013
0 references
Summary: When using interior methods for solving semidefinite programming (SDP), one needs to solve a system of linear equations at each iteration. For problems of large size, solving the system of linear equations can be very expensive. In this paper, based on a semismooth equation reformulation using Fischer's function, we propose a filter method with trust region for solving large-scale SDP problems. At each iteration we perform a number of conjugate gradient iterations, but do not need to solve a system of linear equations. Under mild assumptions, the convergence of this algorithm is established. Numerical examples are given to illustrate the convergence results obtained.
0 references