Country: Germany

Found 3096 papers in total
Optimal strategies in a class of zero-sum ergodic stochastic games
Optimal strategies in a class of zero-sum ergodic stochastic games
1999,
In this paper we study zero-sum stochastic games with Borel state spaces. We make some...
Blackwell optimality in the class of all policies in Markov decision chains with a Borel state space and unbounded rewards
Blackwell optimality in the class of all policies in Markov decision chains with a Borel state space and unbounded rewards
1999,
This paper is the second part of our study of Blackwell optimal policies in Markov...
On the optimality of the Gittins index rule for multi-armed bandits with multiple plays
On the optimality of the Gittins index rule for multi-armed bandits with multiple plays
1999,
We investigate the general multi-armed bandit problem with multiple servers. We...
On some balanced, totally balanced and submodular delivery games
On some balanced, totally balanced and submodular delivery games
1999,
This paper studies a class of delivery problems associated with the Chinese postman...
A non-interior continuation method for generalized linear complementarity problems
A non-interior continuation method for generalized linear complementarity problems
1999,
In this paper, we propose a non-interior continuation method for solving generalized...
Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
1999,
A class of affine-scaling interior-point methods for bound constrained optimization...
A hybrid Newton method for solving the variational inequality problem via a D-gap function
A hybrid Newton method for solving the variational inequality problem via a D-gap function
1999,
The variational inequality problem (VIP) can be reformulated as an unconstrained...
On existence and uniqueness of stationary points in semi-infinite optimization
On existence and uniqueness of stationary points in semi-infinite optimization
1999,
The paper deals with semi-infinite optimization problems which are defined by finitely...
Coercivity conditions and variational inequalities
Coercivity conditions and variational inequalities
1999,
Various coercivity conditions appear in the literature in order to guarantee solutions...
Strong efficiency in a locally convex space
Strong efficiency in a locally convex space
1999,
A new kind of proper efficiency, namely strong efficiency, is introduced in a locally...
bc-opt: A branch-and-cut code for mixed integer programs
bc-opt: A branch-and-cut code for mixed integer programs
1999,
A branch-and-cut mixed integer programming system, called bc-opt, is described,...
A branch-and-cut method of 0–1 mixed convex programming
A branch-and-cut method of 0–1 mixed convex programming
1999,
We generalize the disjunctive approach of Balas, Ceria, and Cornuéjols and...
Convex programming for disjunctive convex optimization
Convex programming for disjunctive convex optimization
1999,
Given a finite number of closed convex sets whose algebraic representation is known,...
Ergodic, primal convergence in dual subgradient schemes for convex programming
Ergodic, primal convergence in dual subgradient schemes for convex programming
1999,
Lagrangean dualization and subgradient optimization techniques are frequently used...
Some characterizations and properties of the ‘distance to ill-posedness’ and the condition measure of a conic linear system
Some characterizations and properties of the ‘distance to ill-posedness’ and the condition measure of a conic linear system
1999,
A conic linear system is a system of the form P(d): find x that solves b – Ax...
An infeasible-interior-point potential-reduction algorithm for linear programming
An infeasible-interior-point potential-reduction algorithm for linear programming
1999,
This paper studies a new potential-function and an infeasible-interior-point method...
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...
Implicit multifunction theorems for the sensitivity analysis of variational conditions
Implicit multifunction theorems for the sensitivity analysis of variational conditions
1999,
This note corrects a faulty application of the theory to the sensitivity analysis of...
Basis- and partition identification for quadratic programming and linear complementarity problems
Basis- and partition identification for quadratic programming and linear complementarity problems
1999,
Optimal solutions of interior point algorithms for linear and quadratic programming...
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...
Estimating the conditional mode of a stationary stochastic process from noisy observations
Estimating the conditional mode of a stationary stochastic process from noisy observations
1999,
Let {( X i , Y i )}, i ≥ 1, be a strictly stationary process from noisy...
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...
Papers per page: