Journal: Mathematical Programming

Found 797 papers in total
Avoiding numerical cancellation in the interior point method for solving semidefinite programs
Avoiding numerical cancellation in the interior point method for solving semidefinite programs
2003,
The matrix variables in a primal–dual pair of semidefinite programs are getting...
Exploiting sparsity in semidefinite programming via matrix completion II: Implementation and numerical results
Exploiting sparsity in semidefinite programming via matrix completion II: Implementation and numerical results
2003,
In Part I of this series of articles, we introduced a general framework of exploiting...
A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
2003,
The authors of this paper recently introduced a transformation that converts a class...
Numerical evaluation of ‘SBmethod’, a version of the Spectral Bundle method, for combinatorial optimization
Numerical evaluation of ‘SBmethod’, a version of the Spectral Bundle method, for combinatorial optimization
2003,
We report numerical results for SBmethod – a publicly available implementation...
Non-interior continuation methods for solving semidefinite complementarity problems
Non-interior continuation methods for solving semidefinite complementarity problems
2003,
There recently has been much interest in non-interior continuation/smoothing methods...
On the maximum feasible subsystem problem, Irreducible infeasible subsystems and their hypergraphs
On the maximum feasible subsystem problem, Irreducible infeasible subsystems and their hypergraphs
2003,
We consider the Max FS problem: For a given infeasible linear system Ax ≤ b,...
Accumulating Jacobians as chained sparse matrix products
Accumulating Jacobians as chained sparse matrix products
2003,
The chain rule – fundamental to any kind of analytical differentiation –...
Karush–Kuhn–Tucker systems: Regularity conditions, error bounds and a class of Newton-type methods
Karush–Kuhn–Tucker systems: Regularity conditions, error bounds and a class of Newton-type methods
2003,
We consider optimality systems of Karush–Kuhn–Tucker (KKT) type, which...
Integral decomposition of polyhedra and some applications in mixed integer programming
Integral decomposition of polyhedra and some applications in mixed integer programming
2003,
This paper addresses the question of decomposing an infinite family of rational...
A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0–1 programming
A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0–1 programming
2003,
We establish a precise correspondence between lift-and-project cuts for mixed...
Integer linear programming models for 2-staged two-dimensional Knapsack problems
Integer linear programming models for 2-staged two-dimensional Knapsack problems
2003,
We are given a unique rectangular piece of stock material S , with height W , and a...
Optimal labelling of point features in rectangular labeling models
Optimal labelling of point features in rectangular labeling models
2003,
We investigate the NP -hard label number maximization problem ( LNM ): Given a set of...
Primal separation for 0/1 polytopes
Primal separation for 0/1 polytopes
2003,
The 0/1 primal separation problem is: Given an extreme point &xmacr; of a 0/1 polytope...
On the polyhedral structure of a multi-item production model with setup times
On the polyhedral structure of a multi-item production model with setup times
2003,
We present and study a mixed integer programming model that arises as a substructure...
Dynamic knapsack sets and capacitated lot-sizing
Dynamic knapsack sets and capacitated lot-sizing
2003,
A dynamic knapsack set is a natural generalization of the 0–1 knapsack set with...
A multi-item production planning model with setup times: Algorithms, reformulations, and polyhedral characterizations for a special case
A multi-item production planning model with setup times: Algorithms, reformulations, and polyhedral characterizations for a special case
2003,
We study a special case of a structured mixed integer programming model that arises in...
Graph partitioning using linear and semidefinite programming
Graph partitioning using linear and semidefinite programming
2003,
Graph partition is used in the telecommunication industry to subdivide a transmission...
Constraint identification and algorithm stabilization for degenerate nonlinear programs
Constraint identification and algorithm stabilization for degenerate nonlinear programs
2003,
In the vicinity of a solution of a nonlinear programming problem at which both strict...
Solving problems with semidefintie and related constraints using interior-point methods for nonlinear programming
Solving problems with semidefintie and related constraints using interior-point methods for nonlinear programming
2003,
In this paper, we describe how to reformulate a problem that has second-order cone...
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
2003,
In this paper, we present a nonlinear programming algorithm for solving semidefinite...
An augmented Lagrangian interior-point method using directions of negative curvature
An augmented Lagrangian interior-point method using directions of negative curvature
2003,
We describe an efficient implementation of an interior-point algorithm for non-convex...
Decomposition of test sets in stochastic integer programming
Decomposition of test sets in stochastic integer programming
2003,
We study Graver test sets for linear two-stage stochastic integer programs and show...
Scenario reduction in stochastic programming
Scenario reduction in stochastic programming
2003,
Given a convex stochastic programming problem with a discrete initial probability...
Solving semidefinite–quadratic–linear programs using SDPT3
Solving semidefinite–quadratic–linear programs using SDPT3
2003,
This paper discusses computational experiments with linear optimization problems...
Papers per page: