An adaptive incremental approach for the solution of convex programming models

A proposed approach for the solution of convex programming problems is introduced. It is based on an incremental procedure and the maximum number of increments does not exceed the total number of constraints. The details of the algorithm are given and an illustrative example is presented.