Journal: Mathematical Programming

Found 797 papers in total
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
1992,
This paper shows, by means of an operator called a splitting operator, that the...
ℝ-optimality criteria for convex programming problems via exact penalty functions
ℝ-optimality criteria for convex programming problems via exact penalty functions
1992,
The paper presents • -optimality criteria for convex programming problems...
Unconstrained duals to partially separable constrained programs
Unconstrained duals to partially separable constrained programs
1992,
In this note partially separable convex programs are dualized in such a way that,...
New scaling algorithms for the assignment and minimum mean cycle problems
New scaling algorithms for the assignment and minimum mean cycle problems
1992,
In this paper the authors suggest new scaling algorithms for the assignment and...
A time indexed formulation of non-preemptive single machine scheduling problems
A time indexed formulation of non-preemptive single machine scheduling problems
1992,
The authors consider the formulation of non-preemptive single machine scheduling...
Optimal partitions having disjoint convex and conic hulls
Optimal partitions having disjoint convex and conic hulls
1992,
Let A 1 ,...,A n be distinct k -dimensional vectors. The authors consider the problem...
Computation of equilibria in an economy with increasing returns to scale technologies
Computation of equilibria in an economy with increasing returns to scale technologies
1990,
The purpose of this paper is to show that equilibria in an economy with increasing...
On the equivalence between strong solvability and strict semimonotonicity for some systems involving Z-functions
On the equivalence between strong solvability and strict semimonotonicity for some systems involving Z-functions
1991,
This paper focuses on the relationship between the ‘strong’ solvability of...
An interior point algorithm to solve computationally difficult set covering problems
An interior point algorithm to solve computationally difficult set covering problems
1991,
The authors present an interior point approach to the zero-one integer programming...
On lower bound updates in primal potential reduction methods for linear programming
On lower bound updates in primal potential reduction methods for linear programming
1991,
The paper presents a procedure or computing lower bounds for the optimal cost in a...
A combined phase I-phase II scaled potential algorithm for linear programming
A combined phase I-phase II scaled potential algorithm for linear programming
1991,
The paper develops an extension of the affinely scaled potential reduction algorithm...
Improving the rate of convergence of interior point methods for linear programming
Improving the rate of convergence of interior point methods for linear programming
1991,
This paper proposes a procedure for improving the rate of convergence of interior...
A survey of search directions in interior point methods for linear programming
A survey of search directions in interior point methods for linear programming
1991,
A basic characteristic of an interior point algorithm for linear programming is the...
Integrability of vector and multivector fields associated with interior point methods for linear programming
Integrability of vector and multivector fields associated with interior point methods for linear programming
1991,
In the feasible region of a linear programming problem, a number of ‘desirably...
Computational results of an interior point algorithm for large scale linear programming
Computational results of an interior point algorithm for large scale linear programming
1991,
This paper gives computational results for an efficient implementation of a variant of...
An O(n3L) adaptive path following algorithm for a linear complementarity problem
An O(n3L) adaptive path following algorithm for a linear complementarity problem
1991,
This paper proposes an O( n 3 L ) algorithm which is a modification of the path...
Global convergence of affine scaling methods for degenerate linear programming problems
Global convergence of affine scaling methods for degenerate linear programming problems
1991,
This paper shows the global convergence of the affine scaling methods without assuming...
Comparative analysis of affine scaling algorithms based on simplifying assumptions
Comparative analysis of affine scaling algorithms based on simplifying assumptions
1991,
The paper analyzes several affine potential reduction algorithms for linear...
A potential-function reduction algorithm for solving a linear program directly from an infeasible ‘warm start’
A potential-function reduction algorithm for solving a linear program directly from an infeasible ‘warm start’
1991,
This paper develops an algorithm for solving a standard-form linear program directly...
On the complexity of following the central path of linear programs by linear extrapolation II
On the complexity of following the central path of linear programs by linear extrapolation II
1991,
A class of algorithms is proposed for solving linear programming problems (with m...
Linearization of mixed-integer products
Linearization of mixed-integer products
1991,
The subject of this paper is replacement of the product of a binary variable and a...
Making sparse matrices sparser: Computational results
Making sparse matrices sparser: Computational results
1990,
Many optimization algorithms involve repeated processing of a fixed set of linear...
Feasibility issues in primal-dual interior-point method for linear programming
Feasibility issues in primal-dual interior-point method for linear programming
1990,
A new method for obtaining an initial feasible interior-point solution to a linear...
Polynomial affine algorithms for linear programming
Polynomial affine algorithms for linear programming
1990,
The method of steepest descent with scaling (affine scaling) applied to the potential...
Papers per page: