Results 1  10
of
692,375
The Economics of Inequality
, 1975
"... Measures of inequality are used by economists to answer a wide range of questions. Is the distribution of income more equal than it was in the past? Are underdeveloped countries characterised by greater inequality than advanced countries? Do taxes lead to greater equality in the distri ..."
Abstract

Cited by 1236 (4 self)
 Add to MetaCart
Measures of inequality are used by economists to answer a wide range of questions. Is the distribution of income more equal than it was in the past? Are underdeveloped countries characterised by greater inequality than advanced countries? Do taxes lead to greater equality in the distri
Inequality and Growth in a Panel of Countries
 JOURNAL OF ECONOMIC GROWTH
, 1999
"... Evidence from a broad panel of countries shows little overall relation between income inequality and rates of growth and investment. However, for growth, higher inequality tends to retard growth in poor countries and encourage growth in richer places. The Kuznets curve—whereby inequality first incre ..."
Abstract

Cited by 487 (4 self)
 Add to MetaCart
Evidence from a broad panel of countries shows little overall relation between income inequality and rates of growth and investment. However, for growth, higher inequality tends to retard growth in poor countries and encourage growth in richer places. The Kuznets curve—whereby inequality first
GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems
 SIAM J. SCI. STAT. COMPUT
, 1986
"... We present an iterative method for solving linear systems, which has the property ofminimizing at every step the norm of the residual vector over a Krylov subspace. The algorithm is derived from the Arnoldi process for constructing an l2orthogonal basis of Krylov subspaces. It can be considered a ..."
Abstract

Cited by 2046 (40 self)
 Add to MetaCart
as a generalization of Paige and Saunders’ MINRES algorithm and is theoretically equivalent to the Generalized Conjugate Residual (GCR) method and to ORTHODIR. The new algorithm presents several advantages over GCR and ORTHODIR.
A DecisionTheoretic Generalization of onLine Learning and an Application to Boosting
, 1996
"... ..."
Improved algorithms for optimal winner determination in combinatorial auctions and generalizations
, 2000
"... Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NPcomplete and inapproximable, but it was recently shown that optimal search algorithms do very well on average. This paper present ..."
Abstract

Cited by 598 (55 self)
 Add to MetaCart
a more general tractable special case, and design algorithms for solving it as well as for solving known tractable special cases substantially faster. We generalize combinatorial auctions to multiple units of each item, to reserve prices on singletons as well as combinations, and to combinatorial
SNOPT: An SQP Algorithm For LargeScale Constrained Optimization
, 2002
"... Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first deriv ..."
Abstract

Cited by 582 (23 self)
 Add to MetaCart
Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first
Automatic Discovery of Linear Restraints Among Variables of a Program
, 1978
"... The model of abstract interpretation of programs developed by Cousot and Cousot [2nd ISOP, 1976], Cousot and Cousot [POPL 1977] and Cousot [PhD thesis 1978] is applied to the static determination of linear equality or inequality invariant relations among numerical variables of programs. ..."
Abstract

Cited by 733 (47 self)
 Add to MetaCart
The model of abstract interpretation of programs developed by Cousot and Cousot [2nd ISOP, 1976], Cousot and Cousot [POPL 1977] and Cousot [PhD thesis 1978] is applied to the static determination of linear equality or inequality invariant relations among numerical variables of programs.
Computing Inequality: Have Computers Changed the Labor Market?”Quarterly
 Journal of Economics
, 1998
"... This paper examines the effect of skillbiased technological change as measured by computerization on the recent widening of U. S. educational wage differentials. An analysis of aggregate changes in the relative supplies and wages of workers by education from 1940 to 1996 indicates strong and persis ..."
Abstract

Cited by 473 (18 self)
 Add to MetaCart
This paper examines the effect of skillbiased technological change as measured by computerization on the recent widening of U. S. educational wage differentials. An analysis of aggregate changes in the relative supplies and wages of workers by education from 1940 to 1996 indicates strong and persistent growth in relative demand favoring college graduates. Rapid skill upgrading within detailed industries accounts for most of the growth in the relative demand for college workers, particularly since 1970. Analyses of four data sets indicate that the rate of skill upgrading has been greater in more computerintensive industries. I.
Global Optimization with Polynomials and the Problem of Moments
 SIAM Journal on Optimization
, 2001
"... We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x) : R R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear mat ..."
Abstract

Cited by 569 (47 self)
 Add to MetaCart
We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x) : R R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear
Results 1  10
of
692,375