Title: Sequential Convex Programming Methods for Solving Nonlinear Optimization Problems with DC constraints
Abstract: This paper investigates the relation between sequential convex programming (SCP) as, e.g., defined in [24] and DC (difference of two convex functions) programming. We first present an SCP algorithm for solving nonlinear optimization problems with DC constraints and prove its convergence. Then we combine the proposed algorithm with a relaxation technique to handle inconsistent linearizations. Numerical tests are performed to investigate the behaviour of the class of algorithms.
Publication Year: 2011
Publication Date: 2011-07-28
Language: en
Type: preprint
Access and Citation
Cited By Count: 35
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot