A FETI-DP formulation for three dimensional elasticity problems on non-matching grids is considered. To resolve the nonconformity of the finite elements, a mortar matching condition is imposed on subdomain interfaces. The mortar matching condition are considered as weak continuity constraints in the FETIDP formulation. A relatively large set of primal constraints, which include average and mome...

We represent the Ising model of statistical physics by Forney factor graphs in the primal and in the dual domains. By analogy with Kirchhoff’s voltage and current laws, we show that in the primal Forney factor graph, the dependency among the variables is along the cycles, whereas in the dual Forney factor graph, the dependency is on the cutsets. In the primal (resp. dual) domain, dependent vari...

In this paper, we consider a general primal-dual nonlinear rescaling (PDNR) method for convex optimization with inequality constraints. We prove the global convergence of the PDNR method and estimate the error bounds for the primal and dual sequences. In particular, we prove that, under the standard second-order optimality conditions, the error bounds for the primal and dual sequences converge ...

A primal-dual active set method for quadratic problems with bound constraints is presented which extends the infeasible active set approach of Kunisch and Rendl [17]. Based on a guess of the active set, a primal-dual pair (x,α) is computed that satisfies stationarity and the complementary condition. If x is not feasible, the variables connected to the infeasibilities are added to the active set...

Let G be an abelian group and let R be a commutative G-graded super-ring (briefly, graded super-ring) with unity 1 6= 0. We say that a ∈ h(R), where h(R) is the set of homogeneous elements in R, is weakly prime to a graded superideal I of R if 0 6= r a ∈ I , where r ∈ h(R), then r ∈ I . If ν(I ) is the set of homogeneous elements in R that are not weakly prime to I , then we define I to be weak...

We propose a generic path-following scheme which is essentially a method of centers that can be implemented with a variety of algorithms. The complexity estimate is computed on the sole assumption that a certain local quadratic convergence property holds, independently of the speciic algorithmic procedure in use, primal, dual or primal-dual. We show convergence in O(p n) iterations. We verify t...

This paper presents estimates of the degree of returns to scale using nonparametric measures of primal and dual productivity for 2-digit US manufacturing industries. As part of the analysis, the cyclical behaviour of primal and dual productivity measures are considered, time-varying markups are allowed for, and the small sample properties of the instrumental variables estimator used to derive t...

Primal infon logic (PIL) was introduced in 2009 in the framework of policy and trust management. In the meantime, some generalizations appeared, and there have been some changes in the syntax of the basic PIL. This paper is on the basic PIL, and one of our purposes is to “institutionalize” the changes. We prove a small-model theorem for the propositional fragment of basic primal infon logic (PP...

Lagrangean dualization and subgradient optimization techniques are frequently used within the field of computational optimization for finding approximate solutions to large, structured optimization problems. The dual subgradient scheme does not automatically produce primal feasible solutions; there is an abundance of techniques for computing such solutions (via penalty functions, tangential app...

Interior-point methods possess strong theoretical properties and have been successfully applied to a wide variety of linear and nonlinear programming applications. This paper presents a class of algorithms, based on interior-point methodology, for performing regularized maximum likelihood reconstructions on 3-D emission tomography data. The algorithms solve a sequence of subproblems that conver...