#### Filter Results:

#### Publication Year

1984

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We describe a primal-dual interior point algorithm for linear programming problems which requires a total of O(~fnL) number of iterations, where L is the input size. Each iteration updates a penalty parameter and finds the Newton direction associated with the Karush-Kuhn-Tucker system of equations which characterizes a solution of the logarithmic barrier… (More)

We describe an algorithm for linear and convex quadratic programming problems that uses power series approximation of the weighted barrier path that passes through the current iterate in order to find the next iterate. If r > 1 is the order of approximation used, we show that our algorithm has time complexity O(n t(+l/r)L(l+l/r)) iterations and O(n3 + n2r)… (More)

— We formulate a two-settlement equilibrium in competitive electricity markets as a subgame-perfect Nash equilibrium in which each generation firm solves a Mathematical Program with Equilibrium Constraints (MPEC), given other firms' forward and spot strategies. We implement two computational approaches, one of which is based on a Penalty Interior Point… (More)

We describe a primal-dual interior point algorithm for convex quadratic programming problems which requires a total of O(~/nL) number of iterations, where L is the input size. Each iteration updates a penalty parameter and finds an approximate Newton direction associated with the Karush-Kuhn-Tucker system of equations which characterizes a solution of the… (More)

We consider the continuous trajectories of the vector field induced by the primal affine scaling algorithm as applied to linear programming problems in standard form. By characterizing these trajectories as solutions of certain parametrized logarithmic barrier families of problems, we show that these trajectories tend to an optimal solution which in general… (More)

A model of two-settlement electricity markets is introduced, which accounts for flow congestion, demand uncertainty, system contingencies, and market power. We formulate the subgame perfect Nash equilibrium for this model as an equilibrium problem with equilibrium constraints (EPEC), in which each firm solves a mathematical program with equilibrium… (More)

This paper describes the implementation of power series dual affine scaling variants of Karmarkar's algorithm for linear programming. Based on a continuous version of Karmarkar's algorithm, two variants resulting from first and second order approximations of the continuous trajectory are implemented and tested. Linear programs are expressed in an inequality… (More)

We consider a coalescing particle model where particles move in discrete time. At each time period, each remaining ball is independently put in one of n bins according to a probability distribution p ϭ (p 1 ,. .. , p n), and all balls put into the same bin merge into a single ball. Starting with k balls, we are interested in the properties of E[N(p, k)],… (More)