Journal: Mathematical Programming

Found 797 papers in total
The volume algorithm revisited: Relation with bundle methods
The volume algorithm revisited: Relation with bundle methods
2002,
We revise the Volume Algorithm (VA) for linear programming and relate it to bundle...
Ideal, weakly efficient solutions for vector optimization problems
Ideal, weakly efficient solutions for vector optimization problems
2002,
We establish existence results for finite dimensional vector minimization problems...
Primal and dual convergence of a proximal point exponential penalty method for linear programming
Primal and dual convergence of a proximal point exponential penalty method for linear programming
2002,
We consider the diagonal inexact proximal point iteration ((u k − u k−1...
Combinatorial interior point methods for generalized network flow problems
Combinatorial interior point methods for generalized network flow problems
2002,
We present combinatorial interior point methods for the generalized minimum cost flow...
The mathematics of playing golf, or: A new class of difficult non-linear mixed integer programs
The mathematics of playing golf, or: A new class of difficult non-linear mixed integer programs
2002,
We consider a class of non-linear mixed integer programs with n integer variables and...
Solving a class of semidefinite programs via nonlinear programming
Solving a class of semidefinite programs via nonlinear programming
2002,
In this paper, we introduce a transformation that converts a class of linear and...
A spectral bundle method with bounds
A spectral bundle method with bounds
2002,
Semidefinite relaxations of quadratic 0–1 programming or graph partitioning...
On some interior-point algorithms for nonconvex quadratic optimization
On some interior-point algorithms for nonconvex quadratic optimization
2002,
Recently, interior-point algorithms have been applied to nonlinear and nonconvex...
A note on sensitivity of value functions of mathematical programs with complementarity constraints
A note on sensitivity of value functions of mathematical programs with complementarity constraints
2002,
Using standard nonlinear programming (NLP) theory, we establish formulas for first and...
On the convergence of the Weiszfeld algorithm
On the convergence of the Weiszfeld algorithm
2002,
In this work we analyze the paper ‘Brimberg, J.: The Fermat–Weber location...
Conditioning of convex piecewise linear stochastic programs
Conditioning of convex piecewise linear stochastic programs
2002,
In this paper we consider stochastic programming problems where the objective function...
Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
2002,
We consider stochastic programming problems with probabilistic constraints involving...
An analytic center quadratic cut method for the convex quadratic feasibility problem
An analytic center quadratic cut method for the convex quadratic feasibility problem
2002,
We consider a quadratic cut method based on analytic centers for two cases of convex...
The relation of time indexed formulations of single machine scheduling problems to the node packing problem
The relation of time indexed formulations of single machine scheduling problems to the node packing problem
2002,
The relation of time indexed formulations of nonpreemptive single machine scheduling...
Multistars, partial multistars and the capacitated vehicle routing problem
Multistars, partial multistars and the capacitated vehicle routing problem
2002,
In an unpublished paper, Araque, Hall and Magnanti considered polyhedra associated...
On the chromatic polynomial of a graph
On the chromatic polynomial of a graph
2002,
Let P(G,λ) be the chromatic polynomial of a graph G with n vertices,...
An improved rounding method and semidefinite programming relaxation for graph partition
An improved rounding method and semidefinite programming relaxation for graph partition
2002,
Given an undirected graph G = (V, E) with |V| = n and an integer k...
On capacitated network design cut–set polyhedra
On capacitated network design cut–set polyhedra
2002,
This paper provides an analysis of capacitated network design cut–set polyhedra....
Randomized pivot algorithms for P-matrix linear complementarity problems
Randomized pivot algorithms for P-matrix linear complementarity problems
2002,
We study orientations of the n -cube that come from simple principal pivot algorithms...
On error bounds for lower semicontinuous functions
On error bounds for lower semicontinuous functions
2002,
We give some sufficient conditions for proper lower semicontinuous functions on metric...
A descent method for submodular function minimization
A descent method for submodular function minimization
2002,
We show a descent method for submodular function minimization based on an oracle for...
Robust optimization – methodology and applications
Robust optimization – methodology and applications
2002,
Robust Optimization (RO) is a modeling methodology, combined with computational tools,...
Componentwise fast convergence in the solution of full-rank systems of nonlinear equations
Componentwise fast convergence in the solution of full-rank systems of nonlinear equations
2002,
The asymptotic convergence of parameterized variants of Newton's method for the...
UOBYQA: Unconstrained optimisation by quadratic approximation
UOBYQA: Unconstrained optimisation by quadratic approximation
2002,
UOBYQA is a new algorithm for general unconstrained optimization calculations, that...
Papers per page: