Journal: Mathematical Programming (Series A)

Found 506 papers in total
A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
1992,
A parallel branch and bound algorithm that solves the asymmetric traveling salesman...
Local minima for indefinite Quadratic Knapsack Problems
Local minima for indefinite Quadratic Knapsack Problems
1992,
The paper considers the complexity of finding a local minimum for the nonconvex...
Characterization of stable matchings as extreme points of a polytope
Characterization of stable matchings as extreme points of a polytope
1992,
The purpose of this paper is to extend a modified version of a recent result of Vande...
Structural properties and decomposition of linear balanced matrices
Structural properties and decomposition of linear balanced matrices
1992,
Claude Berge defines a (0,1) matrix A to be linear if A does not contain a 2×2...
Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
1991,
This paper presents extensions and further analytical properties of algorithms for...
Solving knapsack sharing problems with general tradeoff functions
Solving knapsack sharing problems with general tradeoff functions
1991,
A knapsack sharing problem is a maximin or minimax mathematical programming problem...
Computing a global optimal solution to a design centering problem
Computing a global optimal solution to a design centering problem
1992,
In this paper the authors present a method for solving a special three-dimensional...
A note on a characterization of P-matrices
A note on a characterization of P-matrices
1992,
In this note the authors show that the characterization results for P-matrices due to...
A network penalty method
A network penalty method
1991,
The authors consider the minimum cost network flow problem and describe how the...
An iteration potential reduction algorithm for linear complementarity problems
An iteration potential reduction algorithm for linear complementarity problems
1991,
This paper proposes an interior point algorithm for a positive semi-definite linear...
Solving (large scale) matching problems combinatorially
Solving (large scale) matching problems combinatorially
1991,
In this paper the authors describe computational results for a modification of the...
Use of dynamic trees in a network simplex algorithm for the maximum flow problem
Use of dynamic trees in a network simplex algorithm for the maximum flow problem
1991,
Goldfarb and Hao have proposed a pivot rule for the primal network simplex algorithm...
Finding minimum-cost flows by double scaling
Finding minimum-cost flows by double scaling
1992,
Several researchers have recently developed new techniques that give fast algorithms...
A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure
A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure
1992,
This paper develops a decomposition method using a pricing mechanism which has been...
Convergence of a generalized subgradient method for nondifferentiable convex optimization
Convergence of a generalized subgradient method for nondifferentiable convex optimization
1991,
A generalized subgradient method is considered which uses the subgradients at previous...
Effort associated with a class of random optimization methods
Effort associated with a class of random optimization methods
1991,
When differentiability is not assumed random procedures can be successfully used to...
The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
1991,
The main purpose of this paper is the extension of Powell’s global convergence...
Convergence of quasi-Newton matrices generated by the symmetric rank one update
Convergence of quasi-Newton matrices generated by the symmetric rank one update
1991,
Quasi-Newton algorithms for unconstrained nonlinear minimization generate a sequence...
Concave minimization via conical partitions and polyhedral outer approximation
Concave minimization via conical partitions and polyhedral outer approximation
1991,
An algorithm is proposed for globally minimizing a concave function over a compact...
The primal-dual algorithm as a constraint-set-manipulation device
The primal-dual algorithm as a constraint-set-manipulation device
1991,
A general primal-dual algorithm for linearly constrained optimization problems is...
Finite termination of the proximal point algorithm
Finite termination of the proximal point algorithm
1991,
This paper concerns the notion of a sharp minimum on a set and its relationship to the...
Factorized quasi-Newton methods for nonlinear least squares problems
Factorized quasi-Newton methods for nonlinear least squares problems
1991,
This paper provides a modification to the Gauss-Newton method for nonlinear least...
Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization
Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization
1991,
The paper proposes an algorithm for minimizing a function f on ℝ n in the...
A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
1991,
This paper presents a globally convergent, locally quadratically convergent algorithm...
Papers per page: