Abstract
A new method and algorithm for the efficient solution of a class of nonlinear semidefinite programming problems is introduced. The new method extends a concept proposed recently for the solution of convex semidefinite programs based on the sequential convex programming (SCP) idea. In the core of the method, a generally non-convex semidefinite program is replaced by a sequence of subproblems, in which nonlinear constraint and objective functions defined in matrix variables are approximated by block separable convex models. Global convergence is proved under reasonable assumptions. The article is concluded by numerical experiments with challenging Free Material Optimization problems subject to displacement constraints.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
