Journal: Mathematical Programming

Found 797 papers in total
Feasible descent algorithms for mixed complementarity problems
Feasible descent algorithms for mixed complementarity problems
1999,
In this paper we consider a general algorithmic framework for solving nonlinear mixed...
Properties of an interior embedding for solving nonlinear optimization problems
Properties of an interior embedding for solving nonlinear optimization problems
1999,
The paper presents an interior embedding of nonlinear optimization problems. This...
A new bound for the ratio between the 2-matching problem and its linear programming relaxation
A new bound for the ratio between the 2-matching problem and its linear programming relaxation
1999,
Consider the 2-matching problem defined on the complete graph, with edge costs which...
Hit-and-run mixes fast
Hit-and-run mixes fast
1999,
It is shown that the ‘hit-and-run’ algorithm for sampling from a convex...
Computational study of a column generation algorithm for bin packing and cutting stock problems
Computational study of a column generation algorithm for bin packing and cutting stock problems
1999,
This paper reports on our attempt to design an efficient exact algorithm based on...
Global convergence of a class of non-interior point algorithms using Chen–Harker–Kanzow–Smale functions for nonlinear complementarity problems
Global convergence of a class of non-interior point algorithms using Chen–Harker–Kanzow–Smale functions for nonlinear complementarity problems
1999,
We propose a class of non-interior point algorithms for solving the complementarity...
Lifting valid inequalities for the precedence constrained knapsack problem
Lifting valid inequalities for the precedence constrained knapsack problem
1999,
This paper considers the precedence constrained knapsack problem. More specifically,...
Conditioning of semidefinite programs
Conditioning of semidefinite programs
1999,
This paper studies the conditioning of semidefinite programs by analyzing the effect...
A symmetrical linear maxmin approach to disjoint bilinear programming
A symmetrical linear maxmin approach to disjoint bilinear programming
1999,
The disjoint bilinear programming problem can be reformulated using two distinct...
A parametric view on the Mangesarian–Fromovitz constraint qualification
A parametric view on the Mangesarian–Fromovitz constraint qualification
1999,
In this paper we consider the behaviour of the multipliers for one-parametric...
Linear convergence of epsilon-subgradient descent methods for a class of convex functions
Linear convergence of epsilon-subgradient descent methods for a class of convex functions
1999,
This paper establishes a linear convergence rate for a class of epsilon-subgradient...
Strong conical hull intersection property, bounded linear regularity, Jameson's property (G), and error bounds in convex optimization
Strong conical hull intersection property, bounded linear regularity, Jameson's property (G), and error bounds in convex optimization
1999,
The strong conical hull intersection property and bounded linear regularity are...
A method of projection onto an acute cone with level control in convex minimization
A method of projection onto an acute cone with level control in convex minimization
1999,
We study a projection method for convex minimization problems. In each step we...
Fixed-charge continuous knapsack problems and pseudogreedy solutions
Fixed-charge continuous knapsack problems and pseudogreedy solutions
1999,
We investigate nonlinear continuous knapsack problems, which can be classified as...
Lifted flow cover inequalities for mixed 0–1 integer programs
Lifted flow cover inequalities for mixed 0–1 integer programs
1999,
We investigate strong inequalities for mixed 0–1 integer programs derived from...
A polynomial time interior-point path-following algorithm for the linear complementarity problem based on Chen–Harker–Kanzow smoothing techniques
A polynomial time interior-point path-following algorithm for the linear complementarity problem based on Chen–Harker–Kanzow smoothing techniques
1999,
A polynomial complexity bound is established for an interior-point path-following...
Approximating the complexity measure of Vavasis–Ye algorithm is NP-hard
Approximating the complexity measure of Vavasis–Ye algorithm is NP-hard
1999,
Given an m × n integer matrix A of full row rank, we consider the problem of...
Finiteness of conical algorithms with omega subdivisions
Finiteness of conical algorithms with omega subdivisions
1999,
In this paper the problem of finding the global optimum of a concave function over a...
Smooth methods of multipliers for complementarity problems
Smooth methods of multipliers for complementarity problems
1999,
This paper describes several methods for solving nonlinear complementarity problems. A...
Upper bounds for Gaussian stochastic programs
Upper bounds for Gaussian stochastic programs
1999,
We present a construction which gives deterministic upper bounds for stochastic...
An interior Newton method for quadratic programming
An interior Newton method for quadratic programming
1999,
We propose a new (interior) approach for the general quadratic programming problem. We...
A note on quadratic forms
A note on quadratic forms
1999,
We extend an interesting theorem of Yuan for two quadratic forms to three matrices....
A polyhedral approach to single-machine scheduling problems
A polyhedral approach to single-machine scheduling problems
1999,
We report new results for a time-indexed formulation of nonpreemptive single-machine...
A branch-and-cut algorithm for capacitated network design problems
A branch-and-cut algorithm for capacitated network design problems
1999,
We present a branch-and-cut algorithm to solve capacitated network design problems....
Papers per page: