Journal: Mathematical Programming (Series A)

Found 506 papers in total
Parallel decomposition of multistage stochastic programming problems
1993,
A new decomposition method for multistage stochastic linear programming problems is...
A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions
1993,
This paper presents a theoretical result on convergence of a primal affine-scaling...
Signature classes of transportation polytopes
1993,
Signature algorithms solve certain classes of transportation problems in a number of...
The graphical relaxation: A new framework for the symmetric traveling salesman polytope
1993,
A present trend in the study of the Symmetric Traveling Salesman Polytope ( STSP( n))...
Hamiltonian path and symmetric travelling salesman polytopes
1993,
The authors introduce a projective approach for studying symmetric travelling salesman...
A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets
1993,
Given any family ℱ of valid inequalities for the asymmetric traveling salesman...
A note on the prize collecting traveling salesman problem
1993,
The authors study the version of the prize collecting traveling salesman problem,...
Symmetric indefinite systems for interior point methods
1993,
The authors present a unified framework for solving linear and convex quadratic...
Solution of linear least squares via the ABS algorithm
1993,
The ABS class for linear and nonlinear systems has been recently introduced by Abaffy,...
The D2-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations
1993,
A triangulation of arbitrary refinement of grid sizes of (0,1]×ℝ n is...
Remarks on the generalized Newton method
1993,
The paper gives some convergence results for the generalized Newton method for the...
Directional differentiability of optimal solutions under Slater’s condition
1993,
For convex parametric optimization problems it is shown that the optimal solution is...
Restricted Simplicial Decomposition for convex constrained problems
1993,
The strategy of Restricted Simplicial Decomposition is extended to convex programs...
Dual coordinate ascent methods for non-strictly convex minimization
1993,
The paper considers a dual method for solving non-strictly convex programs possessing...
Convex composite multi-objective nonsmooth programming
1993,
This paper examines nonsmooth constrained multi-objective optimization problems where...
A little theorem of the big
1993,
When the authors apply interior point algorithms to various problems including linear...
On the convergence of the exponential multiplier method for convex programming
1993,
In this paper, the authors analyze the exponential method of multipliers for convex...
Conditions for the discovery of solution horizons
1993,
The authors present necessary and sufficient conditions for discrete infinite horizon...
On connections between approximate second-order directional derivative and second-order Dini derivative for convex functions
1993,
For a real-valued convex function , the existence of the second-order Dini derivative...
A lift-and-project cutting plane algorithm for mixed 0-1 programming problems
1993,
The authors propose a cutting plane algorithm for mixed 0-1 programs based on a family...
Mixed-integer bilinear programming problems
1993,
This paper addresses a class of problems called mixed-integer bilinear programming...
Towards equitable distribution via proportional equity constraints
1993,
The authors propose a new approach to the formulation of models for solving problems...
Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem
1993,
The purpose of this study is to broaden the scope of projective transformation methods...
Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
1993,
This paper proposes two sets of rules, Rule G and Rule P, for controlling step lengths...
Papers per page: