Journal: Mathematical Programming (Series A)

Found 506 papers in total
Interior-point algorithms for semi-infinite programming
Interior-point algorithms for semi-infinite programming
1994,
In order to study the behavior of interior-point methods on very large-scale linear...
The maximum entropy method on the mean: Applications to linear programming and superresolution
The maximum entropy method on the mean: Applications to linear programming and superresolution
1994,
In this paper, the authors give two different results. They propose new methods to...
Computatinal experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming
Computatinal experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming
1994,
Kojima, Megiddo, and Mizuno proved global convergence of a primal-dual algorithm that...
A projection method for lp norm location-allocation problems
A projection method for lp norm location-allocation problems
1994,
The authors present a solution method for location-allocation problems involving the l...
Constant potential primal-dual algorithms: A framework
Constant potential primal-dual algorithms: A framework
1994,
The paper starts with a study of the primal-dual affine-scaling algorithms for linear...
Superlinear convergence of infeasible-interior-point methods for linear programming
Superlinear convergence of infeasible-interior-point methods for linear programming
1994,
At present the interior-point methods of choice are primal-dual...
Limiting behavior of weighted central paths in linear programming
Limiting behavior of weighted central paths in linear programming
1994,
The paper studies the limiting behavior of the weighted central paths in linear...
Polynomiality of infeasible-interior-point algorithms for linear programming
Polynomiality of infeasible-interior-point algorithms for linear programming
1994,
Kojima, Megiddo, and Mizuno investigate an infeasible-interior-point algorithm for...
A criterion for time aggregation in intertemporal dynamic models
A criterion for time aggregation in intertemporal dynamic models
1994,
Nonlinear intertemporal general equilibrium models are hard to solve because of the...
A class of gap functions for variational inequalities
A class of gap functions for variational inequalities
1994,
Recently Auchmuty has introduced a new class of merit functions, or optimization...
A continuous deformation algorithm for variational inequality problems on polytopes
A continuous deformation algorithm for variational inequality problems on polytopes
1994,
A continuous deformation algorithm is proposed for solving a variational inequality...
A separation algorithm for the matchable set polytope
A separation algorithm for the matchable set polytope
1994,
A matchable set of a graph is a set of vertices joined in pairs by disjoint edges....
Polyhedra for lot-sizing with Wagner-Whitin costs
Polyhedra for lot-sizing with Wagner-Whitin costs
1994,
The authors examine the single-item lot-sizing problem with Wagner-Whitin costs over...
Two-edge connected spanning subgraphs and polyhedra
Two-edge connected spanning subgraphs and polyhedra
1994,
This paper studies the probelm of finding a two-edge connected spanning subgraph of...
The Steiner problem I: Formulations, compositions and extension of facets
The Steiner problem I: Formulations, compositions and extension of facets
1994,
In this paper the authors give some integer programming formulations for the Steiner...
The Steiner tree problem II: Properties and classes of facets
The Steiner tree problem II: Properties and classes of facets
1994,
This is the second part of two papers addressing the study of the facial structure of...
Near-perfect matrices
Near-perfect matrices
1994,
A 0,1 matrix A is near-perfect if the integer hull of the polyhedron { x≥0:Ax•...
On weighted multiway cuts in trees
On weighted multiway cuts in trees
1994,
A min-max theorem is developed for the multiway cut problem of edge-weighted trees....
Characterizing consistency in probabilistic logic for a class of Horn clauses
Characterizing consistency in probabilistic logic for a class of Horn clauses
1994,
The problem of consistently assigning probabilities to logical formulas is an...
Matroids and a forest cover problem
Matroids and a forest cover problem
1994,
A forest cover of a graph is a spanning forest for which each component has at least...
On the k-cut subgraph polytope
On the k-cut subgraph polytope
1994,
The authors consider the problem of finding a minimum-cost set of k- pairwise-disjoint...
Relaxation-based algorithms for minimax optimization problems with resource allocation applications
Relaxation-based algorithms for minimax optimization problems with resource allocation applications
1994,
The authors consider minimax optimization problems where each term in the objective...
Qualification conditions for multivalued functions in Banach spaces with applications to nonsmooth vector optimization problems
Qualification conditions for multivalued functions in Banach spaces with applications to nonsmooth vector optimization problems
1994,
The paper introduces qualification conditions for multivalued functions in Banach...
A proximal-based decomposition method for convex minimization problems
A proximal-based decomposition method for convex minimization problems
1994,
This paper presents a decomposition method for solving convex minimization problems....
Papers per page: