Journal: Mathematical Programming (Series A)

Found 506 papers in total
On the extended linear complementarity problem
On the extended linear complementarity problem
1996,
For the extended linear complementarity problem, the paper introduces and...
Complementarity formulations and existence of solutions of dynamic multi-rigid-body contact problems with Coulomb friction
Complementarity formulations and existence of solutions of dynamic multi-rigid-body contact problems with Coulomb friction
1996,
In this paper, the authors study the problem of predicting the acceleration of a set...
Generalized equations and the generalized Newton method
Generalized equations and the generalized Newton method
1996,
The paper gives some convergence results on the generalized Newton method (referred to...
A superquadratic infeasible-interior-point method for linear complementarity problems
A superquadratic infeasible-interior-point method for linear complementarity problems
1996,
The authors consider a modification of a path-following infeasible-interior-point...
Shortest paths algorithms: Theory and experimental evaluation
Shortest paths algorithms: Theory and experimental evaluation
1996,
The authors conduct an extensive computational study of shortest paths algorithms,...
Numerical experiments with the LANCELOT package (Release A) for large-scale nonlinear optimization
Numerical experiments with the LANCELOT package (Release A) for large-scale nonlinear optimization
1996,
In this paper, the authors describe the algorithmic options of Release A of LANCELOT,...
Solving multistage stochastic network programs on massively parallel computers
Solving multistage stochastic network programs on massively parallel computers
1996,
Multi-stage stochastic programs are typically extremely large, and can be...
Hidden convexity in some nonconvex quadratically constrained quadratic programming
Hidden convexity in some nonconvex quadratically constrained quadratic programming
1996,
The authors consider the problem of minimizing an indefinite quadratic objective...
A strongly polynomial algorithm for a convave production-transportation problem with a fixed number of nonlinear variables
A strongly polynomial algorithm for a convave production-transportation problem with a fixed number of nonlinear variables
1996,
The authors show that the production-transportation problem involving an arbitrary...
The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem
The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem
1996,
The paper applies the Douglas-Rachford splitting algotithm to a class of multi-valued...
Note on the computational complexity of j-radii of polytopes in ℝ’n.
Note on the computational complexity of j-radii of polytopes in ℝ’n.
1996,
The authors show that, for fixed dimension n, the approximation of inner and outer j-...
On the nucleolus of the basic vehicle routing game
On the nucleolus of the basic vehicle routing game
1996,
In the vehicle routing cost allocation problem the aim is to find a good cost...
Packing Steiner trees: Polyhedral investigations
Packing Steiner trees: Polyhedral investigations
1996,
Let G=(V,E) be a graph and T⊆V be a node set. The authors call an edge set S a...
Packing Steiner trees: A cutting plane algorithnm and computational results
Packing Steiner trees: A cutting plane algorithnm and computational results
1996,
In this paper the authors describe a cutting plane algorithm for the Steiner tree...
On the partial order polytope of a digraph
On the partial order polytope of a digraph
1996,
The paper introduces the partial order polytope of a digraph D, defined as the convex...
Speeding up Karmarkar’s algorithm for multicommodity flows
Speeding up Karmarkar’s algorithm for multicommodity flows
1996,
The authors show how to speed up Karmarkar’s linear programming algorithm for...
A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines
A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines
1996,
This paper shows that an analogue of the classical conjugate gradient method converges...
A primal-dual approch to inexact subgradient methods
A primal-dual approch to inexact subgradient methods
1996,
For optimization problems with computationally demanding objective functions and...
Extension of Karmarkar’s algorithm onto convex quadratically constrained quadratic problems
Extension of Karmarkar’s algorithm onto convex quadratically constrained quadratic problems
1996,
Convex quadratically constrained quadratic problems are considered. It is shown that...
A quasi-second-order proximal bundle algorithm
A quasi-second-order proximal bundle algorithm
1996,
This paper introduces an algorithm for convex minimization which includes quasi-Newton...
A new algorithm for minimizing convex functions over convex sets
A new algorithm for minimizing convex functions over convex sets
1996,
Let S⊆ℝ’n be a convex set for which there is an oracle with the...
A new algorithm for generalized fractional programs
A new algorithm for generalized fractional programs
1996,
A new dual problem for convex generalized fractional programs with no duality gap is...
On polynomiality of the method of analytic centers for fractional problems
On polynomiality of the method of analytic centers for fractional problems
1996,
The paper establishes polynomial time convergence of the method of analytic centers...
Submodular linear programs on forests
Submodular linear programs on forests
1996,
A general linear programming model for an order-theoretic analysis of both...
Papers per page: