Journal: Mathematical Programming

Found 797 papers in total
Hesitant adaptive search for global optimisation
Hesitant adaptive search for global optimisation
1998,
Pure adaptive search is a stochastic algorithm which has been analysed in distinct...
A simulation-based approach to two-stage stochastic programming with recourse
A simulation-based approach to two-stage stochastic programming with recourse
1998,
In this paper we consider stochastic programming problems where the objective function...
Approximating the independence number via the ϑ-function
Approximating the independence number via the ϑ-function
1998,
We describe an approximation algorithm for the independence number of a graph. If a...
A unified analysis for a class of long-step primal–dual path-following interior-point algorithms for semidefinite programming
A unified analysis for a class of long-step primal–dual path-following interior-point algorithms for semidefinite programming
1998,
We present a unified analysis for a class of long-step primal–dual...
Note on a sufficient condition for a local minimum of a class of nonconvex quadratic programs
Note on a sufficient condition for a local minimum of a class of nonconvex quadratic programs
1998,
A counterexample is given to show that a previously proposed sufficient condition for...
Weak k-majorization and polyhedra
Weak k-majorization and polyhedra
1998,
For integers k and n with k ⩽ n a vector x ∈ ℝ n is said to be weakly k...
Capacitated facility location: Separation algorithms and computational experience
Capacitated facility location: Separation algorithms and computational experience
1998,
We consider the polyhedral approach to solving the capacitated facility location...
On the complexity of approximating a Karush–Kuhn–Tucker point of quadratic programming
On the complexity of approximating a Karush–Kuhn–Tucker point of quadratic programming
1998,
We present a potential reduction algorithm to approximate a...
Strongly polynomial dual simplex methods for the maximum flow problem
Strongly polynomial dual simplex methods for the maximum flow problem
1998,
This paper presents dual network simplex algorithms that require at most 2 nm pivots...
A combined relaxation method for variational inequalities with nonlinear constraints
A combined relaxation method for variational inequalities with nonlinear constraints
1998,
A simple iterative method for solving variational inequalities with a set-valued,...
Local convergence of predictor–corrector infeasible-interior-point algorithms for SDPs and SDLCPs
Local convergence of predictor–corrector infeasible-interior-point algorithms for SDPs and SDLCPs
1998,
An example of an SDP (semidefinite program) exhibits a substantial difficulty in...
A reduction method for variational inequalities
A reduction method for variational inequalities
1998,
This paper explains a method by which the number of variables in a variational...
The topological structure of maximal lattice free convex bodies: The general case
The topological structure of maximal lattice free convex bodies: The general case
1998,
Given a generic m × n matrix A , the simplicial complex 𝒦( A ) is defined...
Rounding algorithms for covering problems
Rounding algorithms for covering problems
1998,
In the last 25 years approximation algorithms for discrete optimization problems have...
Max Horn Satisfiability and the minimum cut problem in directed hypergraphs
Max Horn Satisfiability and the minimum cut problem in directed hypergraphs
1998,
In this paper we consider the Maximum Horn Satisfiability problem, which is reduced to...
On the complexity of linear programming under finite precision arithmetic
On the complexity of linear programming under finite precision arithmetic
1998,
In this paper we study the complexity of solving linear programs in finite precision...
Partitioning mathematical programs for parallel solution
Partitioning mathematical programs for parallel solution
1998,
This paper describes heuristics for partitioning a general M × N matrix into...
Equilibrium programming using proximal-like algorithms
Equilibrium programming using proximal-like algorithms
1997,
We compute constrained equilibria satisfying an optimality condition. Important...
Pseudomonotone variational inequality problems: Existence of solutions
Pseudomonotone variational inequality problems: Existence of solutions
1997,
Necessary and sufficient conditions for the set of solutions of a pseudomonotone...
Polynomiality of primal–dual affine scaling algorithms for nonlinear complementarity problems
Polynomiality of primal–dual affine scaling algorithms for nonlinear complementarity problems
1997,
This paper provides an analysis of the polynomiality of primal–dual interior...
Equivalence of variational inequality problems to unconstrained minimization
Equivalence of variational inequality problems to unconstrained minimization
1997,
In this paper we propose a class of merit functions for variational inequality...
Tradeoff directions in multiobjective optimization problems
Tradeoff directions in multiobjective optimization problems
1997,
Multiobjective optimization problems (MOP) typically have conflicting objectives...
A globally convergent version of the Polak–Ribière conjugate gradient method
A globally convergent version of the Polak–Ribière conjugate gradient method
1997,
In this paper we propose a new line search algorithm that ensures global convergence...
A note on the existence of the Alizadeh–Haeberly–Overton direction for semidefinite programming
A note on the existence of the Alizadeh–Haeberly–Overton direction for semidefinite programming
1997,
This note establishes a new sufficient condition for the existence and uniqueness of...
Papers per page: