We consider computing the saddle points of a convex-concave function using subgradient methods. The existing literature on finding saddle points has mainly focused on establishing convergence properties of the generated iterates under some restrictive assumptions. In this paper, we propose a subgradient algorithm for generating approximate saddle points and provide per-iteration convergence rat...

This paper deals with a semidefinite program (SDP) having free variables, which often appears in practice. To apply the primal-dual interior-point method, we usually need to convert our SDP into the standard form having no free variables. One simple way of conversion is to represent each free variable as a difference of two nonnegative variables. But this conversion not only expands the size of...

An algorithm is developd from the associated generator trees of basic dual solutions of a two-step transportation problem. This is completely appropiate for the “Balinski signature method” for the obtention of prime solutions of the two-step transportation problem

Common numerical methods for constrained convex optimization are predicated on efficiently computing nearest points to the feasible region. The presence of a design matrix in the constraints yields feasible regions with more complex geometries. When the functional components are gauges, there is an equivalent optimization problem—the gauge dual—where the matrix appears only in the objective fun...

in this note we consider the notion of intuitionistic fuzzy (weak) dual hyper k-ideals and obtain related results. then we classify this notion according to level sets. after that we determine the relationships between intuitionistic fuzzy (weak) dual hyper k-ideals and intuitionistic fuzzy (weak) hyper k-ideals. finally, we define the notion of the product of two intuitionistic fuzzy (weak) du...

0

In this paper, we show that the moving directions of the primal-affine scaling method (with logarithmic barrier function), the dual-affine scaling method (with logarithmic barrier function), and the primal-dual interior point method are merely the Newton directions along three different algebraic "paths" that lead to a solution of the Karush-Kuhn-Tucker conditions of a given linear programming ...

In the present paper, a numerical investigation of transport phenomena is considered in electrically-conducting nanofluid flow within a porous bed utilizing Buongiorno’s transport model and Runge-Kutta-Fehlberg fourth-fifth order method. Induced flow by non-isothermal stretching/shrinking sheet along with magnetic field impact, dissipation effect, and slip conditions at the surface are...

‎we present an application of the dual gabor frames to image‎ ‎processing‎. ‎our algorithm is based on finding some dual gabor‎ ‎frame generators which reconstructs accurately the elements of the‎ ‎underlying hilbert space‎. ‎the advantages of these duals‎ ‎constructed by a polynomial of gabor frame generators are compared‎ ‎with their canonical dual‎.

We present newM2 and M5 brane solutions in M-theory based on transverse AtiyahHitchin space and other self-dual geometries. One novel feature of these solutions is that they have bolt-like fixed points yet still preserve 1/4 of the supersymmetry. All the solutions can be reduced down to ten dimensional intersecting brane configurations. EMail: [email protected] EMail: [email protected]...