A path-following algorithm for linear programming using quadratic and logarithmic penalty functions

A path-following algorithm for linear programming using quadratic and logarithmic penalty functions

Cover title.

Bibliographic Details
Other Authors:	Tseng, Paul.
Language:	eng
Published:	Laboratory for Information and Decision Systems, Massachusetts Institute of Technology] 2003
Subjects:	TK7855.M41 E3845 no.1963
Online Access:	http://hdl.handle.net/1721.1/3193

Similar Items

Robust linear quadratic designs with real parameter uncertainty
Published: (2003)

Closed-loop structural stability for linear-quadratic optimal systems
Published: (2002)

Linear-quadratic optimal control revisited
Published: (2002)

A simple polynomial-time algorithm for convex quadratic programming
Published: (2003)

Logarithmic Sobolev inequalities and stochastic Ising models
Published: (2003)

An auction algorithm for shortest paths
Published: (2003)

A very simple polynomial-time algorithm for linear programming
Published: (2003)

Modified auction algorithms for shortest paths
Published: (2003)

Parallel shortest path auction algorithms
Published: (2003)

Polynomial auction algorithms for shortest paths
Published: (2003)

Complexity analysis of a linear complementarity algorithm based on a Lyapunov function
Published: (2003)

Forward path search : a new dual coordinate ascent algorithm for shortest paths
Published: (2003)

Communication complexity of distributed shortest path algorithms
Published: (2003)

An adaptive distributed Dijkstra shortest path algorithm
Published: (2003)

Integral quadratic constraints for systems with rate limiters
Published: (2003)

Efficient algorithms for continuous-space shortest path problems
Published: (2003)

Discrete-time Markovian jump linear quadratic optimal control
Published: (2002)

Relaxation methods for linear programs
Published: (2003)

A simple and fast label correcting algorithm for shortest paths
Published: (2003)

An alternating direction method for linear programming
Published: (2003)

On logarithmic transformations in discrete-time stochastic control
Published: (2003)

An auction/sequential shortest path algorithm for the minimum cost network flow problem
Published: (2003)

Relaxation method for linear programs with side constraints
Published: (2003)

Augmented Lagrangian and differentiable exact penalty methods
Published: (2002)

Certainty equivalent solutions of quadratic team problems by a decentralized innovations approach
Published: (2002)

Relaxation method for large scale linear programming using decomposition
Published: (2003)

The relaxation method for a special class of linear programming problems
Published: (2003)

On the convergence of a matrix splitting algorithm for the symmetric linear complementarity problem
Published: (2003)

On computing the nested sums and infimal convolutions of convex piecewise-linear functions
Published: (2003)

Basis descent methods for convex essentially smooth optimization with applications to quadratic/entropy optimization and resource allocation
Published: (2003)

Distributed computation for linear programming problems satisfying certain diagonal dominance condition
Published: (2003)

Stable linear approximations to dynamic programming for stochastic control problems with local transitions
Published: (2003)

Partial proximal minimization algorithms for convex programming
Published: (2003)

An analysis of stochastic shortest path problems
Published: (2003)

Stochastic shortest path problems with recourse
Published: (2003)

Parallel asynchronous label correcting methods for shortest paths
Published: (2003)

Applications of a splitting algorithm to decomposition in convex programming and variational inequalities
Published: (2003)

Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
Published: (2003)

Linear multivariable control : numerical considerations
Published: (2002)

Asymptotic orders of reachability in perturbed linear systems
Published: (2003)