Conic optimization is the minimization of a differentiable convex objective function subject to conic constraints. We propose novel primal–dual first-order method for optimization, named proportional–integral projected gradient (PIPG). PIPG ensures that both gap and constraint violation converge zero at rate O(1/k), where k number iterations. If strongly convex, improves convergence O(1/k2). Fu...