Journal: Mathematical Programming

Found 797 papers in total
Nonlinear complementarity as unconstrained and constrained minimization
Nonlinear complementarity as unconstrained and constrained minimization
1993,
The nonlinear complementarity problem is cast as an unconstrained minimization problem...
A rapidly convergent five-point algorithm for univariate minimization
A rapidly convergent five-point algorithm for univariate minimization
1993,
This paper presents an algorithm for minimizing a function of one variable which uses...
Staircase transportation problems with superadditive rewards and cumulative capacities
Staircase transportation problems with superadditive rewards and cumulative capacities
1993,
A cumulative-capacitated transportation problem is studied. The supply nodes and...
A polynomial-time algorithm for computing the yolk in fixed dimension
A polynomial-time algorithm for computing the yolk in fixed dimension
1992,
The yolk, developed by Ferejohn, McKelvey and Packel and McKelvey, is a key solution...
On better heuristics for Steiner minimum trees
On better heuristics for Steiner minimum trees
1992,
Finding a shortest network interconnecting a given set of points in a metric space is...
Deciding uniqueness in norm maximization
Deciding uniqueness in norm maximization
1992,
NP-hardness is established for the problem whose instance is a system of linear...
On average complexity of global optimization problems
On average complexity of global optimization problems
1992,
The average case complexity of global optimization problems is discussed. The average...
An interior point algorithm of
An interior point algorithm of
1992,
The authors present a theoretical result on a path-following algorithm for convex...
Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices
Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices
1992,
The authors show that a modified variant of the interior point method can solve linear...
On the finite convergence of interior-point algorithms for linear programming
On the finite convergence of interior-point algorithms for linear programming
1992,
It has been shown that numerous interior-point algorithms for linear programming (LP)...
A continuous approach to inductive inference
A continuous approach to inductive inference
1992,
In this paper the authors describe an interior point mathematical programming approach...
A scaling technique for finding the weighted analytic center of a polytope
A scaling technique for finding the weighted analytic center of a polytope
1992,
Let a bounded full dimensional polytope be defined by the system where A is an matrix....
Exterior point algorithms for nearest points and convex quadratic programs
Exterior point algorithms for nearest points and convex quadratic programs
1992,
The authors consider the problem of finding the nearest point (by Euclidean distance)...
Approximation algorithms for indefinite quadratic programming
Approximation algorithms for indefinite quadratic programming
1992,
The paper considers •- approximation schemes for indefinite quadratic...
Facets for the cut cone II: Clique-web inequalities
Facets for the cut cone II: Clique-web inequalities
1992,
The authors study new classes of facets for the cut cone C n generated by the cuts of...
Properties of balanced and perfect matrices
Properties of balanced and perfect matrices
1992,
In this paper the authors define wheel matrices and characterize some properties of...
Facets for the cut cone I
Facets for the cut cone I
1992,
The authors study facets of the cut cone i.e., the cone of dimension generated by the...
A cutting plane method for the windy postman problem
A cutting plane method for the windy postman problem
1992,
In this paper the authors describe a cutting plane algorithm for the (NP-hard) windy...
Probabilistic analysis of the generalised assignment problem
Probabilistic analysis of the generalised assignment problem
1992,
The authors analyse the generalised assignment problem under the assumption that all...
Minimum Principle Sufficiency
Minimum Principle Sufficiency
1992,
The authors characterize the property of obtaining a solution to a convex program by...
Partially finite convex programming, Part I: Quasi relative interiors and duality theory
Partially finite convex programming, Part I: Quasi relative interiors and duality theory
1992,
The authors study convex programs that involve the minimization of a convex function...
Partially finite convex programming, Part II: Explicit lattice models
Partially finite convex programming, Part II: Explicit lattice models
1992,
In Part I of this work the authors derived a duality theorem for partially finite...
Generalization of Slater’s constraint qualification for infinite convex programs
Generalization of Slater’s constraint qualification for infinite convex programs
1992,
where g=(g 1 ,g 2 ) and S=S 1 ×S 2 , S i are convex cones, i=1,2 C is a convex...
Optimality conditions for non-finite valued convex composite functions
Optimality conditions for non-finite valued convex composite functions
1992,
Burke has recently developed second-order necessary and sufficient conditions for...
Papers per page: