Results 1  10
of
11,859
An almost ideal demand system.
 American Economic Review,
, 1980
"... Ever since Richard Stone (1954) first estimated a system of demand equations derived explicitly from consumer theory, there has been a continuing search for alternative specifications and functional forms. Many models have been proposed, but perhaps the most important in current use, apart from the ..."
Abstract

Cited by 636 (0 self)
 Add to MetaCart
the original linear expenditure system, are the Rotterdam model (see In Section I of the paper, we discuss the theoretical specification of the AIDS and justify the claims in the previous paragraph. In Section II, the model is estimated on postwar British data and we use our results to test the homogeneity
The Dantzig selector: statistical estimation when p is much larger than n
, 2005
"... In many important statistical applications, the number of variables or parameters p is much larger than the number of observations n. Suppose then that we have observations y = Ax + z, where x ∈ R p is a parameter vector of interest, A is a data matrix with possibly far fewer rows than columns, n ≪ ..."
Abstract

Cited by 879 (14 self)
 Add to MetaCart
≪ p, and the zi’s are i.i.d. N(0, σ 2). Is it possible to estimate x reliably based on the noisy data y? To estimate x, we introduce a new estimator—we call the Dantzig selector—which is solution to the ℓ1regularization problem min ˜x∈R p ‖˜x‖ℓ1 subject to ‖A T r‖ℓ ∞ ≤ (1 + t −1) √ 2 log p · σ
Adjustable robust solutions of uncertain linear programs
, 2004
"... We consider linear programs with uncertain parameters, lying in some prescribed uncertainty set, where part of the variables must be determined before the realization of the uncertain parameters (“nonadjustable variables”), while the other part are variables that can be chosen after the realization ..."
Abstract

Cited by 370 (12 self)
 Add to MetaCart
cases, equivalent to a tractable optimization problem (typically an LP or a Semidefinite problem), and in other cases, having a tight approximation which is tractable. The AARC approach is illustrated by applying it to a multistage inventory management problem.
Branchandprice: Column generation for solving huge integer programs
 OPER. RES
, 1998
"... We discuss formulations of integer programs with a huge number of variables and their solution by column generation methods, i.e., implicit pricing of nonbasic variables to generate new columns or to prove LP optimality at a node of the branchandbound tree. We present classes of models for which t ..."
Abstract

Cited by 360 (13 self)
 Add to MetaCart
this approach decomposes the problem, provides tighter LP relaxations, and eliminates symmetry. We then discuss computational issues and implementation of column generation, branchandbound algorithms, including special branching rules and efficient ways to solve the LP relaxation. We also discuss
SDPT3  a MATLAB software package for semidefinite programming
 OPTIMIZATION METHODS AND SOFTWARE
, 1999
"... This software package is a Matlab implementation of infeasible pathfollowing algorithms for solving standard semidefinite programming (SDP) problems. Mehrotratype predictorcorrector variants are included. Analogous algorithms for the homogeneous formulation of the standard SDP problem are also imp ..."
Abstract

Cited by 361 (16 self)
 Add to MetaCart
This software package is a Matlab implementation of infeasible pathfollowing algorithms for solving standard semidefinite programming (SDP) problems. Mehrotratype predictorcorrector variants are included. Analogous algorithms for the homogeneous formulation of the standard SDP problem are also
Svmknn: Discriminative nearest neighbor classification for visual category recognition
 in CVPR
, 2006
"... We consider visual category recognition in the framework of measuring similarities, or equivalently perceptual distances, to prototype examples of categories. This approach is quite flexible, and permits recognition based on color, texture, and particularly shape, in a homogeneous framework. While n ..."
Abstract

Cited by 342 (10 self)
 Add to MetaCart
We consider visual category recognition in the framework of measuring similarities, or equivalently perceptual distances, to prototype examples of categories. This approach is quite flexible, and permits recognition based on color, texture, and particularly shape, in a homogeneous framework. While
A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem
 COMBINATORICA
"... We present a factor 2 approximation algorithm for finding a minimumcost subgraph having at least a specified number of edges in each cut. This class of problems includes, among others, the generalized Steiner network problem, which is also known as the survivable network design problem. Our algorit ..."
Abstract

Cited by 266 (3 self)
 Add to MetaCart
algorithm first solves the linear relaxation of this problem, and then iteratively rounds off the solution. The key idea in rounding off is that in a basic solution of the LP relaxation, at least one edge gets included at least to the extent of half. We include this edge into our integral solution and solve
Shape optimization by the homogenization method
, 1997
"... In the context of shape optimization, we seek minimizers of the sum of the elastic compliance and of the weight of a solid structure under specified loading. This problem is known not to be wellposed, and a relaxed formulation is introduced. Its effect is to allow for microperforated composites a ..."
Abstract

Cited by 206 (20 self)
 Add to MetaCart
In the context of shape optimization, we seek minimizers of the sum of the elastic compliance and of the weight of a solid structure under specified loading. This problem is known not to be wellposed, and a relaxed formulation is introduced. Its effect is to allow for microperforated composites
Bidding and Allocation in Combinatorial Auctions
 IN ACM CONFERENCE ON ELECTRONIC COMMERCE
, 2000
"... When an auction of multiple items is performed, it is often desirable to allow bids on combinations of items, as opposed to only on single items. Such an auction is often called "combinatorial", and the exponential number of possible combinations results in computational intractability o ..."
Abstract

Cited by 275 (11 self)
 Add to MetaCart
. We then consider the problem of determining the best allocation  a problem known to be computationally intractable. We suggest an approach based on Linear Programming (LP) and motivate it. We prove that the LP approach finds an optimal allocation if and only if prices can be attached to single
An efficient ascendingbid auction for multiple objects
 AMERICAN ECONOMIC REVIEW
, 1997
"... In multipleobject environments where individual bidders may demand more than one object, standard methods of auction generally result in allocative inefficiency. This paper proposes a new ascendingbid method for auctioning homogeneous goods, such as Treasury bills or communications spectrum. The a ..."
Abstract

Cited by 283 (31 self)
 Add to MetaCart
In multipleobject environments where individual bidders may demand more than one object, standard methods of auction generally result in allocative inefficiency. This paper proposes a new ascendingbid method for auctioning homogeneous goods, such as Treasury bills or communications spectrum
Results 1  10
of
11,859