In a soft environment, we investigated several (classical) structures such as ideals, filters, grills, etc. It is well known that these are applied to expand abstract concepts; in addition, some of them offer vital tool address practical issues, especially those related improving rough approximation operators and accuracy measures. Herein, contribute this line research by presenting novel type ...

In a recent paper [8], Chan and Sun reported for semidefinite programming (SDP) that the primal/dual constraint nondegeneracy is equivalent to the dual/primal strong second order sufficient condition (SSOSC). This result is responsible for a number of important results in stability analysis of SDP. In this paper, we study duality of this type in nonlinear semidefinite programming (NSDP). We int...

Consider the utilization of a Lagrangian dual method which is convergent for consistent convex optimization problems. When it is used to solve an infeasible optimization problem, its inconsistency will then manifest itself through the divergence of the sequence of dual iterates. Will then the sequence of primal subproblem solutions still yield relevant information regarding the primal program? ...

for any reduced commutative $f$-ring with identity and bounded inversion, we show that a condition which is obviously necessary for the socle of the ring to coincide with the socle of its bounded part, is actually also sufficient. the condition is that every minimal ideal of the ring consist entirely of bounded elements. it is not too stringent, and is satisfied, for instance, by rings of conti...

for a fixed positive integer , we say a ring with identity is n-generalized right principally quasi-baer, if for any principal right ideal of , the right annihilator of is generated by an idempotent. this class of rings includes the right principally quasi-baer rings and hence all prime rings. a certain n-generalized principally quasi-baer subring of the matrix ring are studied, and connections...

An approach to determine primal and dual stepsizes in the infeasible{ interior{point primal{dual method for convex quadratic problems is presented. The approach reduces the primal and dual infeasibilities in each step and allows diierent stepsizes. The method is derived by investigating the eecient set of a multiobjective optimization problem. Computational results are also given.

A new initialization or ‘Phase I’ strategy for feasible interior point methods for linear programming is proposed that computes a point on the primal-dual central path associated with the linear program. Provided there exist primal-dual strictly feasible points — an all-pervasive assumption in interior point method theory that implies the existence of the central path — our initial method (Algo...

We consider a Primal-Dual Augmented Lagrangian (PDAL) method for optimization problems with equality constraints. Each step of the PDAL requires solving the Primal-Dual linear system of equations. We show that under the standard second-order optimality condition the PDAL method generates a sequence, which locally converges to the primal-dual solution with quadratic rate.

Iterative substructuring methods with Lagrange multipliers for the elliptic system of linear elasticity are considered. The algorithms belong to the family of dual-primal FETI methods which was introduced for linear elasticity problems in the plane by Farhat et al. [2001] and then extended to three dimensional elasticity problems by Farhat et al. [2000]. In dual-primal FETI methods, some contin...