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.

18 pages, 1 figure

References in corpus (1)

• A proximal method for composite minimization

Cited by in corpus (8)

• Parallel and Distributed Methods for Nonconvex Optimization--Part II: Applications
• Energy Efficiency Fairness for Multi-Pair Wireless-Powered Relaying Systems
• Phase Retrieval Using Feasible Point Pursuit: Algorithms and Cramér-Rao Bound
• Parallel and Distributed Methods for Nonconvex Optimization-Part I: Theory
• Generalized Quadratic Matrix Programming: A Unified Framework for Linear Precoding With Arbitrary Input Distributions
• Joint MOO of Transmit Precoding and Receiver Design in a Downlink Time Switching MISO SWIPT System
• Optimality Conditions for Cardinality-Constrained Programs and a SCA Method
• TW-TOA Based Positioning in the Presence of Clock Imperfections