Results 1  10
of
6,727
A FeasiblePoint Sagitta Approach in Linear Programming
"... Abstract. A second scheme for the sagitta method is presented. This method uses a “global ” viewpoint of the linear problem, and, in this feasiblepoint version, it also takes advantage of the additional “local” information that a feasible point supplies. The computational results obtained are highl ..."
Abstract
 Add to MetaCart
Abstract. A second scheme for the sagitta method is presented. This method uses a “global ” viewpoint of the linear problem, and, in this feasiblepoint version, it also takes advantage of the additional “local” information that a feasible point supplies. The computational results obtained
Lag length selection and the construction of unit root tests with good size and power
 Econometrica
, 2001
"... It is widely known that when there are errors with a movingaverage root close to −1, a high order augmented autoregression is necessary for unit root tests to have good size, but that information criteria such as the AIC and the BIC tend to select a truncation lag (k) that is very small. We conside ..."
Abstract

Cited by 558 (14 self)
 Add to MetaCart
framework in which the movingaverage root is local to −1 to document how the MIC performs better in selecting appropriate values of k. In montecarlo experiments, the MIC is found to yield huge size improvements to the DF GLS and the feasible point optimal PT test developed in Elliott, Rothenberg and Stock
On Proving Existence of Feasible Points in Equality Constrained Optimization Problems
 Mathematical Programming
, 1995
"... Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for global optimizers and other contexts, it is of interest to construct bounds around such approximate feasible points, then t ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for global optimizers and other contexts, it is of interest to construct bounds around such approximate feasible points
Feasible Point Pursuit and Successive Approximation of NonConvex QCQPs
"... Abstract—Quadratically constrained quadratic programs (QCQPs) have a wide range of applications in signal processing and wireless communications. Nonconvex QCQPs are NPhard in general. Existing approaches relax the nonconvexity using semidefinite relaxation (SDR) or linearize the nonconvex part ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
convex part and solve the resulting convex problem. However, these techniques are seldom successful in even obtaining a feasible solution when the QCQP matrices are indefinite. In this letter, a new feasible point pursuit successive convex approximation (FPPSCA) algorithm is proposed for nonconvex QCQPs
An Inexact TrustRegion FeasiblePoint Algorithm for Nonlinear Systems of Equalities and Inequalities
 DEPARTMENT OF COMPUTATIONAL AND APPLIED MATHEMATICS, RICE UNIVERSITY
, 1995
"... In this work we define a trustregion feasiblepoint algorithm for approximating solutions of the nonlinear system of equalities and inequalities F(x, y) = 0, y ≥ 0, where F: R^n × R^m → R^p is continuously differentiable. This formulation is quite general; the KarushKuhn ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In this work we define a trustregion feasiblepoint algorithm for approximating solutions of the nonlinear system of equalities and inequalities F(x, y) = 0, y ≥ 0, where F: R^n × R^m → R^p is continuously differentiable. This formulation is quite general; the Karush
Improved and simplified validation of feasible points: Inequality and equality constrained problems
 Mathematical Programming, submitted
, 2005
"... Abstract. In validated branch and bound algorithms for global optimization, upper bounds on the global optimum are obtained by evaluating the objective at an approximate optimizer; the upper bounds are then used to eliminate subregions of the search space. For constrained optimization, in general, a ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
, a small region must be constructed within which existence of a feasible point can be proven, and an upper bound on the objective over that region is obtained. We had previously proposed a perturbation technique for constructing such a region. In this work, we propose a much simplified and improved
Hierarchical Modelling and Analysis for Spatial Data. Chapman and Hall/CRC,
, 2004
"... Abstract Often, there are two streams in statistical research one developed by practitioners and other by main stream statisticians. Development of geostatistics is a very good example where pioneering work under realistic assumptions came from mining engineers whereas it is only now that statisti ..."
Abstract

Cited by 442 (45 self)
 Add to MetaCart
be estimated by ML. Furthermore, ML provides an uncertainty of the estimated parameters what may be used to decide if point estimates are sufficiently accurate or if interval estimation (giving a region of suitable parameters) is more adequate. We discuss various practical and theoretical problems with MLE
The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs
"... informs ® doi 10.1287/ijoc.1030.0046 © 2004 INFORMS This paper develops a method for moving quickly and cheaply from an arbitrary initial point at an extreme distance from the feasible region to a point that is relatively near the feasible region of a nonlinearly constrained model. The method is a v ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
informs ® doi 10.1287/ijoc.1030.0046 © 2004 INFORMS This paper develops a method for moving quickly and cheaply from an arbitrary initial point at an extreme distance from the feasible region to a point that is relatively near the feasible region of a nonlinearly constrained model. The method is a
Internet Indirection Infrastructure
 In Proceedings of ACM SIGCOMM
, 2002
"... Attempts to generalize the Internet's pointtopoint communication abstraction to provide services like multicast, anycast, and mobility have faced challenging technical problems and deployment barriers. To ease the deployment of such services, this paper proposes an overlaybased Internet Indi ..."
Abstract

Cited by 396 (26 self)
 Add to MetaCart
Attempts to generalize the Internet's pointtopoint communication abstraction to provide services like multicast, anycast, and mobility have faced challenging technical problems and deployment barriers. To ease the deployment of such services, this paper proposes an overlaybased Internet
Results 1  10
of
6,727