A Globally Convergent Filter-Type Trust Region Method for Semidefinite Programming
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 Fisch...
Main Authors: | Aiqun Huang, Chengxian Xu |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2012-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2012/819607 |
Similar Items
-
A Note on Convergence Analysis of an SQP-Type Method for Nonlinear Semidefinite Programming
by: Zhang Shaowu, et al.
Published: (2008-01-01) -
A globally convergent QP-free algorithm for nonlinear semidefinite programming
by: Jian-Ling Li, et al.
Published: (2017-06-01) -
A Continuous Trust-Region-Type Method for Solving Nonlinear Semidefinite Complementarity Problem
by: Ying Ji, et al.
Published: (2014-01-01) -
A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming
by: Jian Ling Li, et al.
Published: (2019-08-01) -
On weighted paths for nonlinear semidefinite complementarity problems and newton methods for semidefinite programming
by: Zanjácomo, Paulo Régis
Published: (2008)