Journal: Mathematical Programming (Series A)

Found 506 papers in total
Normal conical algorithm for concave minimization over polytopes
Normal conical algorithm for concave minimization over polytopes
1991,
A new conical algorithm is developed for finding the global minimum of a concave...
The equivalence of strict convexity and injectivity of the gradient in bounded level sets
The equivalence of strict convexity and injectivity of the gradient in bounded level sets
1991,
It is shown that Lipschitzian functions are strictly convex if and only if their...
Directional derivative estimates for the optimal value function of a quasidifferentiable programming problem
Directional derivative estimates for the optimal value function of a quasidifferentiable programming problem
1991,
This paper is concerned with the optimal value function arising in the primal...
Partitioned quasi-Newton methods for nonlinear equality constrained optimization
Partitioned quasi-Newton methods for nonlinear equality constrained optimization
1992,
The authors derive new quasi-Newton updates for the (nonlinear) equality constrained...
Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
1992,
Whether or not the general asymmetric variational inequality problem can be formulated...
A constrained min-max algorithm for rival models of the same economic system
A constrained min-max algorithm for rival models of the same economic system
1992,
There are well established rival theories about the economy. These have, in turn, led...
Pure adaptive search in global optimization
Pure adaptive search in global optimization
1992,
Pure adaptive search iteratively constructs a sequence of interior points uniformly...
Distribution sensitivity in stochastic programming
Distribution sensitivity in stochastic programming
1991,
In this paper, stochastic programming problems are viewed as parametric programs with...
On computing the center of a convex quadratically constrained set
On computing the center of a convex quadratically constrained set
1991,
The authors propose a method for finding analytic center of a convex feasible region...
A class of methods for solving large, convex quadratic programs subject to box constraints
A class of methods for solving large, convex quadratic programs subject to box constraints
1991,
In this paper the authors analyze conjugate gradient-type algorithms for solivng...
Sequential quadratic programming for certain parameter identification problems
Sequential quadratic programming for certain parameter identification problems
1991,
The authors analyze the method of sequential quadratic programming for equality...
The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
1991,
The graphical relaxation of the Traveling Salesman Problem is the relaxation obtained...
The Traveling Salesman Problem in graphs with some excluded minors
The Traveling Salesman Problem in graphs with some excluded minors
1992,
Given a graph and a length function defined on its edge-set, the Traveling Salesman...
An additive bounding procedure for the asymmetric travelling salesman problem
An additive bounding procedure for the asymmetric travelling salesman problem
1992,
In this paper, new lower bounds for the asymmetric travelling salesman problem are...
Traveling salesman games
Traveling salesman games
1992,
In this paper the authors discuss the problem of how to divide the total cost of a...
Paths on polymatroids
Paths on polymatroids
1992,
This paper establishes bounds on the length of certain strictly monotone paths,...
Correlation polytopes: Their geometry and complexity
Correlation polytopes: Their geometry and complexity
1991,
A family of polytypes, correlation polytopes, which arise naturally in the theory of...
Dines-Fourier-Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields
Dines-Fourier-Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields
1992,
A constructive procedure using Dines-Fourier-Motzkin elimination is given for...
Complexity analysis of a linear complementarity algorithm based on a Lyapunov function
Complexity analysis of a linear complementarity algorithm based on a Lyapunov function
1992,
The paper considers a path following algorithm for solving linear complementarity...
On the core of network synthesis games
On the core of network synthesis games
1991,
The paper uses polynomial formulations to show that several rational and discrete...
Nonlinear programming and stationary equilibria in stochastic games
Nonlinear programming and stationary equilibria in stochastic games
1991,
Stationary equilibria in discounted and limiting average finite state/action space...
Facets of two Steiner arborescence polyhedra
Facets of two Steiner arborescence polyhedra
1991,
The Steiner arborescence (or Steiner directed tree) problem concerns the connection of...
On an instance of the inverse shortest paths problem
On an instance of the inverse shortest paths problem
1992,
The inverse shortest paths problem in a graph is considered, that is, the problem of...
Perfect graphs and norms
Perfect graphs and norms
1991,
For a given undirected graph with n vertices the paper defines four norms on , namely...
Papers per page: