Results 1  10
of
112,881
Global Nonlinear Programming with possible infeasibility and finite termination
, 2012
"... In a recent paper, Birgin, Floudas and Martínez introduced an augmented Lagrangian method for global optimization. In their approach, augmented Lagrangian subproblems are solved using the αBB method and convergence to global minimizers was obtained assuming feasibility of the original problem. In th ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. In the present research, the algorithm mentioned above will be improved in several crucial aspects. On the one hand, feasibility of the problem will not be required. Possible infeasibility will be detected in finite time by the new algorithms and optimal infeasibility results will be proved. On the other hand
Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
, 2012
"... In a recent paper, Birgin, Floudas and Martínez introduced an augmented Lagrangian method for global optimization. In their approach, augmented Lagrangian subproblems are solved using the αBB method and convergence to global minimizers was obtained assuming feasibility of the original problem. In th ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
. In the present research, the algorithm mentioned above will be improved in several crucial aspects. On the one hand, feasibility of the problem will not be required. Possible infeasibility will be detected in finite time by the new algorithms and optimal infeasibility results will be proved. On the other hand
Algorithms for infeasible path calculation
 In WCET
, 2006
"... Static WorstCase Execution Time (WCET) analysis is a technique to derive upper bounds for the execution times of programs. Such bounds are crucial when designing and verifying realtime systems. A key component in static WCET analysis is to derive flow information, such as loop bounds and infeasibl ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
and infeasible paths. Such flow information can be provided as either as annotations by the user, can be automatically calculated by a flow analysis, or by a combination of both. To make the analysis as simple, automatic and safe as possible, this flow information should be calculated automatically
Infeasibility And Negative Curvature In Optimization
, 1999
"... Infeasibility and Negative Curvature in Optimization. Erik G. Boman, Stanford University, 1999. It may seem reasonable that only problems with a solution can be solved. However, in practice it may be that some type of \solution" is needed even when the problem is illposed and no solution exis ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
required. However, by allowing a slightly larger pertubation in the constraints, we might nd a much improved value of the objective function. It is quite possible that a \slightly infeasible solution" of this kind would be welcomed by the user. In this thesis we address such issues of infeasibility
Infeasibility of Systems of Halfspaces
, 2001
"... An oriented hyperplane is a hyperplane with designated good and bad sides. The infeasibility of a cell in an arrangement ~ A of oriented hyperplanes is the number of hyperplanes with this cell on the bad side. Wit MinInf( ~ A) we denote the minimum infeasibility of a cell in the arrangement. A s ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
An oriented hyperplane is a hyperplane with designated good and bad sides. The infeasibility of a cell in an arrangement ~ A of oriented hyperplanes is the number of hyperplanes with this cell on the bad side. Wit MinInf( ~ A) we denote the minimum infeasibility of a cell in the arrangement. A
Simplex with Sum of Infeasibilities for SMT
"... Abstract—The de facto standard for stateoftheart real and integer linear reasoning within Satisfiability Modulo Theories (SMT) solvers is the Simplex for DPLL(T) algorithm given by Dutertre and de Moura. This algorithm works by performing a sequence of local optimization operations. While the alg ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
that minimizes the sum of infeasibilities of the constraints. Experimental results show that this new algorithm is comparable with or outperforms Simplex for DPLL(T) on a broad set of benchmarks. I.
Detecting Geometric Infeasibility
 Artificial Intelligence
, 1996
"... An exact and practical method for translational motion planning with many degrees of freedom is derived. It is shown that certain D\Gammadimensional arrangements of hyperplanes can be searched in the following way: only a single connected component is traversed during the search, and the arrangemen ..."
Abstract
 Add to MetaCart
, and the arrangement is searched as an arrangement of surface patches rather than full hyperplanes. This reduction in search effort allows for polynomial time bounds in appropriate cases. Heuristic and randomized planners cannot return an information about infeasibility of planning problems. Experiments
Infeasibilities and Directional Distance Functions
, 2006
"... The purpose of this contribution is to highlight an underexplored property of the directional distance function, a recently introduced generalization of the Shephardian distance function. It diagnoses in detail the economic conditions under which infeasibilities may occur for the case of directional ..."
Abstract
 Add to MetaCart
The purpose of this contribution is to highlight an underexplored property of the directional distance function, a recently introduced generalization of the Shephardian distance function. It diagnoses in detail the economic conditions under which infeasibilities may occur for the case
Logical Omniscience As Infeasibility
"... Logical theories for representing knowledge are often plagued by the socalled Logical Omniscience Problem. The problem stems from the clash between the desire to model rational agents, which should be capable of simple logical inferences, and the fact that any logical inference, however complex, al ..."
Abstract
 Add to MetaCart
Logical theories for representing knowledge are often plagued by the socalled Logical Omniscience Problem. The problem stems from the clash between the desire to model rational agents, which should be capable of simple logical inferences, and the fact that any logical inference, however complex, almost inevitably consists of inference steps that are simple enough. This contradiction points to the fruitlessness of trying to solve the Logical Omniscience Problem qualitatively if the rationality of agents is to be maintained. We provide a quantitative solution to the problem compatible with the two important facets of the reasoning agent: rationality and resource boundedness. More precisely, we provide a test for the logical omniscience problem in a given formal theory of knowledge. The quantitative measures we use are inspired by the complexity theory. We illustrate our framework with a number of examples ranging from the traditional implicit representation of knowledge in modal logic to the language of justification logic, which is capable of spelling out the internal inference process. We use these examples to divide representations of knowledge into logically omniscient and not logically omniscient, thus trying to determine how much information about the reasoning process needs to be present in a theory to avoid logical omniscience. Keywords: epistemic logic, logical omniscience, justification logic, complexity theory
An Economic Specification Leading to Infeasibilities
, 2008
"... This contribution points out a minor problem in the specification of technology when computing the Luenberger productivity indicator that has been hitherto ignored in the literature. The solution of this problem increases the likelihood that the directional distance functions underlying this produc ..."
Abstract
 Add to MetaCart
This contribution points out a minor problem in the specification of technology when computing the Luenberger productivity indicator that has been hitherto ignored in the literature. The solution of this problem increases the likelihood that the directional distance functions underlying this productivity indicator are illdefined.
Results 1  10
of
112,881