Generalized programming by linear approximation of the dual gradient: Equality constraints

A modified generalized programming procedure is presented for solving concave programming problems with equality constraints. The procedure constructs convenient linear approximations of the gradient of the dual and finds points where the approximating functions vanish. In the quadratic programming case, the procedure is finitely convergent. Global convergence is established for the non-quadratic case. Illustrative numerical examples are included.     

Theorizing cyber coercion: The 2014 North Korean operation against Sony

This article challenges the conventional wisdom that cyber operations have limited coercive value. It theorizes that cyber operations contribute to coercion by imposing costs and destabilizing an opponent’s leadership. As costs mount and destabilization spreads, the expected utility of capitulation surpasses that of continued defiance, leading the opponent’s leaders to comply with the coercer’s demands. The article applies this ‘cost-destabilization’ model to the 2014 North Korean cyber operation against Sony. Through cost imposition and leadership destabilization, the North Korean operation, despite its lack of physical destructiveness, caused Sony to make a series of costly decisions to avoid future harm.