Recently the proximal bundle method for minimizing a convex function has been extended to an inexact oracle that delivers function and subgradient values of unknown accuracy. We adapt this method to a partially inexact oracle that becomes exact only when an objective target level for a descent step is met. In Lagrangian relaxation, such oracles may save work by evaluating the dual function appr...

The problem solving ability of expert systems is greatly improved by the way of cooperation among different expert systems in a distributed expert system. However, different expert systems in a distributed expert system may use different inexact reasoning models. To achieve cooperation among these expert systems, in our methodology, the first step is to transform the uncertainty of a propositio...

We present a framework for generalizing the primal-dual gradient method, also known as descent ascent solving convex-concave minimax problems. The is based on observation that method can be viewed an inexact applied to primal problem. Unlike setting of traditional methods, computed by dynamic oracle, which discrete-time dynamical system whose output asymptotically approaches exact gradient. For...

bilevel linear programming  is a decision making problem with a two-level decentralized organization. the textquotedblleft leadertextquotedblright~ is in the upper level and the textquotedblleft followertextquotedblright, in the lower. making a decision at one level affects that at the other one. in this paper, bilevel linear programming  with inexact parameters has been studied and a method is...

This paper presents a lightweight approach to representing inexact dates on the semantic web, in that it imposes minimal ontological commitments on the ontology author and provides data that can be queried using standard approaches. The approach is presented in the context of a significant need to represent inexact dates but the heavyweight nature of existing proposals which can handle such inf...

The inexact primal-dual interior point method which is discussed in this paper chooses a new iterate along an approximation to the Newton direction. The method is the Kojima, Megiddo, and Mizuno globally convergent infeasible interior point algorithm The inexact variation is shown to have the same convergence properties accepting a residual in both the primal and dual Newton step equation also ...