Country: Germany

Found 3096 papers in total
Testing fuzzy linear hypotheses in linear regression models
2003,
In this paper statistical tests with fuzzily forumlated hypotheses are discussed,...
A linear integer programming bound for maximum-entropy sampling
2003,
We introduce a new upper bound for the maximum-entropy sampling problem. Our bound is...
The critical discount factor for finite Markovian decision processes with an absorbing set
2003,
This paper deals with a Markovian decision process with an absorbing set J 0 . We are...
Minimizing risk models in stochastic shortest path problems
2003,
We consider a minimizing risk model in a stochastic shortest path problem in which for...
Bayesian analysis of Markov Modulated Bernoulli Processes
2003,
We consider Markov Modulated Bernoulli Processes (MMBP) where the success probability...
Solution to the risk-sensitive average cost optimality equation in a class of Markov decision processes with finite state space
2003,
This work concerns discrete-time Markov decision processes with finite state space and...
Optimal bid strategies for electricity auctions
2003,
This work deals with strategy optimization for electricity producers. We consider two...
Second-order cone programming
2003,
No abstract.
Non-monotone trust region methods for nonlinear quality constrained optimization without a penalty function
2003,
We propose and analyze a class of penalty-function-free nonmonotone trust-region...
Principal component analysis combined with truncated-Newton minimization for dimensionality reduction of chemical databases
2003,
The similarity and diversity sampling problems are two challenging optimization tasks...
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
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
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
2003,
We report numerical results for SBmethod – a publicly available implementation...
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
2003,
We consider the Max FS problem: For a given infeasible linear system Ax ≤ b,...
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
2003,
We consider optimality systems of Karush–Kuhn–Tucker (KKT) type, which...
A parametric characterization of local optimality
2003,
In a series of papers, Hiriart–Urruty proposed necessary and sufficient global...
A transfer/clearing inventory model under sporadic review
2003,
We consider two locations in tandem of an inventory model, so-called the buffer and...
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
2003,
We establish a precise correspondence between lift-and-project cuts for mixed...
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
2003,
We investigate the NP -hard label number maximization problem ( LNM ): Given a set of...
Papers per page: