Sequential Convex Programming Methods for A Class of Structured Nonlinear Programming

Abstract

In this paper we study a broad class of structured nonlinear programming (SNLP) problems. In particular, we first establish the first-order optimality conditions for them. Then we propose sequential convex programming (SCP) methods for solving them in which each iteration is obtained by solving a convex programming problem. Under some suitable assumptions, we establish that any accumulation point of the sequence generated by the methods is a KKT point of the SNLP problems. In addition, we propose a variant of the SCP method for SNLP in which nonmonotone scheme and ``local'' Lipschitz constants of the associated functions are used. A similar convergence result as mentioned above is established.

18 pages

Cited by in corpus (6)

• A General Iterative Shrinkage and Thresholding Algorithm for Non-convex Regularized Optimization Problems
• Efficient DC Algorithm for Constrained Sparse Optimization
• Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity
• Convergence rate analysis of a sequential convex programming method with line search for a class of constrained difference-of-convex optimization problems
• Fast Learning with Nonconvex L1-2 Regularization
• Sparse Optimization Problem with s-difference Regularization