Abstract In this paper, we establish the second-order differential equation system with the feedback controls for solving the problem of convex programming. Using Lagrange function and projection ...

Subsequently, the OPF problem of the equivalent circuits is formulated via CCP, involving the introduction of a cutting plane through difference-of-convex inequalities to limit the feasible region of ...

Second-order optimality conditions for finite-dimensional smooth and nonsmooth nonlinear programming are obtained by a new method that emphasizes a close connection with geometrical approximation of ...

The first one exploits the second-order cone reformulation of a convex power function, resulting in a second-order cone program, and no approximation is incurred. The second one approximates the ...

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, ...

Primal-dual hybrid gradient (PDHG) is a first-order method for saddle-point problems and convex programming introduced by Chambolle and Pock. Recently, Applegate et al.\ analyzed the behavior of PDHG ...

The theory presented in Part I of this paper led to a Basic Parametric Procedure for a broad class of strictly concave parametric programs. In this part, additional theory is developed that ...