Abstract
Recently, there has been much interest in filter methods for solving linear and nonlinear problems. We describe extensions of such methods to nonlinear semidefinite programming problems. These extensions are based on linear subproblems that combine filter techniques and trust region methods. The results of convergence and the rate of convergence are given. Numerical examples on semidefinite programming problems are also reported.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
