In many real world prediction problems the output is a structured object like a sequence or a tree or a graph. Such problems range from natural language processing to computational biology or computer vision and have been tackled using algorithms, referred to as structured output learning algorithms. We consider the problem of structured classification. In the last few years, large margin class...

This paper introduces the design and implementation of two parallel dual simplex solvers for general large scale sparse linear programming problems. One approach, called PAMI, extends a relatively unknown pivoting strategy called suboptimization and exploits parallelism across multiple iterations. The other, called SIP, exploits purely single iteration parallelism by overlapping computational c...

In this survey, we give an overview of a technique used to design and analyze algorithms that provide approximate solutions to NP -hard problems in combinatorial optimization. Because of parallels with the primal-dual method commonly used in combinatorial optimization, we call it the primal-dual method for approximation algorithms. We show how this technique can be used to derive approximation ...

In this paper we discuss statistical properties and rates of convergence of the Stochastic Dual Dynamic Programming (SDDP) method applied to multistage linear stochastic programming problems. We assume that the underline data process is stagewise independent and consider the framework where at first a random sample from the original (true) distribution is generated and consequently the SDDP alg...

• By convention, the vector formed by taking together all the basic variables is denoted xB. Similarly, cB, `B and uB are formed by taking together the same indices of c, ` and u, respectively. The same notation is also used for the indices in L and U , giving cL, cU , `L, `U , uL, and uU . We already defined B as taking together the basic columns of A. The remaining (nonbasic) columns form the...

in this paper, we introduce hybrid of block-pulse functions and bernstein polynomials and derive operational matrices of integration, dual, differentiation, product and delay of these hybrid functions by a general procedure that can be used for other polynomials or orthogonal functions. then, we utilize them to solvedelay differential equations and time-delay system. the method is based upon ex...

In this paper, we investigate the effects of pollution error on the performance of the parallel adaptive finite element technique proposed by Bank and Holst in 2000. In particular, we consider whether the performance of the algorithm as it was originally proposed can be improved through the use of certain dual functions which give indication of global influences on subdomain errors.

background: workstation design has shift from using single monitor screen to dual monitor screens, which may impose some impacts towards the muscles activity. this study aimed to determine the effect of using dual monitor screen computer to the neck-shoulder muscle activity among computer user. method: this experimental study was conducted in 2015 among 28 healthy students in university malaysi...

Many interior-point methods for linear programming are based on the properties of the logarithmic barrier function. After a preliminary discussion of the convergence of the (primal) projected Newton barrier method, three types of barrier method are analyzed. These methods may be categorized as primal, dual and primal-dual, and may be derived from the application of Newton’s method to different ...