Unlike most convex programming methods previously proposed, this method constructs a minimizing sequence of points $ {x_k}^ {\infty}_ {k=0}$, which is not relaxational.

The first post (What is convex optimization？common constraints and objectives) introduced several basic cones supported in a conic optimization solver: zero cone, nonnegative cone, second-order cone, ...

Abstract: This paper revisits the well-known family of sequential convex programming methods. We adopt the difference of convex programming technique to relax a wide variety of nonconvex optimization ...

Abstract: In this paper we introduce disciplined convex-concave programming (DCCP), which combines the ideas of disciplined convex programming (DCP) with convex-concave programming (CCP).

Programming theory is treated initially without any assumptions about the functions and with interpretation for production and activity analysis. By proof of a general theorem about optimal and ...

A new efficient system of representing the decision-maker's preference structure in solving multicriteria integer programming problems is developed. The problem is solved by an interactive ...

Beijing Institute of Control Engineering, Beijing 100094, P. R. China School of Aerospace Engineering, Tsinghua University, Beijing 100084, P. R. China ...