When E. M. Forster chose “Only connect . . .” as an epigraph to his novel Howards End, he surely wasn’t thinking—it is safe to say—of the kind of connectedness among polities that Professor Wayne Logan describes in his rich, measured, and illuminating article. This should come as no surprise. Forster was exalting the weightless energy of passionate encounter. Logan’s research, by contrast, reve...

Abstract We study the minimization of a rank-one quadratic with indicators and show that underlying set function obtained by projecting out continuous variables is supermodular. Although supermodular is, in general, difficult, specific for can be minimized linear time. convex hull epigraph from inequalities lifting them into nonlinear original space variables. Explicit forms convex-hull descrip...

In this paper, we investigate relation between weak subdifferential and augmented normal cone. We define augmented normal cone via weak subdifferential and vice versa. The necessary conditions for the global maximum are also stated. We produce preliminary properties of augmented normal cones and discuss them via the distance function. Then we obtain the augmented normal cone for the indicator f...

In this article, I read Hilgard Hall as a text of whiteness to explore how one campus building at the University California, Berkeley renders racial power relations in academy. Through lens critical studies, examine Hall’s namesake, architecture features, and weighty epigraph, rescue for human society native values rural life. Specifically, analyse identity dedicated agricultural research educa...

Received 10 February 2009; Revised 25 June 2009; Accepted 25 September 2009 Recommended by K. L. Teo Consider the DC programming problem PA infx∈X{f x − g Ax }, where f and g are proper convex functions defined on locally convex Hausdorff topological vector spaces X and Y, respectively, and A is a linear operator from X to Y . By using the properties of the epigraph of the conjugate functions, ...

Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms developed so far deal only with nonsmooth convex functions. In this paper, we propose a new algorithm for solving nonsmooth optimization problems that are not assumed to be convex. The algorithm combines the traditional c...

In this paper we develop a technique for constructing self-concordant barriers for convex cones. We start from a simple proof for a variant of standard result [1] on transformation of a ν-self-concordant barrier for a set into a self-concordant barrier for its conic hull with parameter (3.08 √ ν + 3.57)2. Further, we develop a convenient composition theorem for constructing barriers directly fo...

This paper considers a distributed convex optimization problem with inequality constraints over time-varying unbalanced digraphs, where the cost function is a sum of local objectives, and each node of the graph only knows its local objective and inequality constraints. Although there is a vast literature on distributed optimization, most of them require the graph to be balanced, which is quite ...

This paper proposes an implementation of a constrained analytic center cutting plane method to solve nonlinear multicommodity flow problems. The new approach exploits the property that the objective of the Lagrangian dual problem has a smooth component with second order derivatives readily available in closed form. The cutting planes issued from the nonsmooth component and the epigraph set of t...