In this paper, we consider the unilateral frictional contact problem of a hyperelastic body in the case of large displacements and small strains. In order to retain the linear elasticity framework, we decompose the deformation into a large global rotation and a small elastic displacement. This co-rotational approach is combined with a primal-dual active set strategy to tackle the contact proble...

Motivated by various applications to computer vision, we consider an integer convex optimization problem which is the dual of the convex cost network flow problem. In this paper, we first propose a new primal algorithm for computing an optimal solution of the problem. Our primal algorithm iteratively updates primal variables by solving associated minimum cut problems. The main contribution in t...

We analyze continuous optimal transport problems in the so-called Kantorovich form, where we seek a plan between two marginals that are probability measures on compact subsets of Euclidean space. consider case regularization with negative entropy respect to Lebesgue measure, which has attracted attention because it can be solved by very simple Sinkhorn algorithm. first regularized problem conte...

Several methods to experimentally induce panic cause profound acid-base disturbances. Evidence suggests that CO(2) inhalations, lactate infusions and, to a certain extent, voluntary hyperventilation can conceivably lead to a common scenario of brain acidosis in the face of disparate intravascular pH alterations. The importance of this event is reflected in data that support a model in which exp...

This note establishes a limiting formula for the conic Lagrangian dual of convex infinite optimization problem, correcting classical version Karney [Math. Programming 27 (1983) 75-82] semi-infinite programs. A reformulation problem with single constraint leads to corresponding dual, called sup-dual, and also primal in case when strong Slater condition holds, which entails sup-duality.

This paper considers the problem of minimizing a linear function over the intersection of an aane space with a closed convex cone. In the rst half of the paper, we give a detailed study of duality properties of this problem and present examples to illustrate these properties. In particular, we introduce the notions of weak/strong feasibility or infeasibility for a general primal-dual pair of co...

We present a coordinate ascent method for a class of semidefinite programming problems that arise in non-convex quadratic integer optimization. These semidefinite programs are characterized by a small total number of active constraints and by low-rank constraint matrices. We exploit this special structure by solving the dual problem, using a barrier method in combination with a coordinate-wise ...

It is known that the Karush-Kuhn-Tucker (KKT) conditions of semidefinite programming can be reformulated as a nonsmooth system via the metric projector over the cone of symmetric and positive semidefinite matrices. We show in this paper that the primal and dual constraint nondegeneracies, the strong regularity, the nonsingularity of the B-subdifferential of this nonsmooth system, and the nonsin...