Rutgers University

About: Rutgers University is a education organization based out in New Brunswick, New Jersey, United States. It is known for research contribution in the topics: Population & Poison control. The organization has 68736 authors who have published 159418 publications receiving 6713860 citations. The organization is also known as: Rutgers, The State University of New Jersey & Rutgers.

The Prevention and Treatment of Missing Data in Clinical Trials

Abstract: Missing data in clinical trials can have a major effect on the validity of the inferences that can be drawn from the trial. This article reviews methods for preventing missing data and, failing that, dealing with data that are missing.

Ground water and climate change

Abstract: As the world's largest distributed store of fresh water, ground water plays a central part in sustaining ecosystems and enabling human adaptation to climate variability and change. The strategic importance of ground water for global water and food security will probably intensify under climate change as more frequent and intense climate extremes (droughts and floods) increase variability in precipitation, soil moisture and surface water. Here we critically review recent research assessing the impacts of climate on ground water through natural and human-induced processes as well as through groundwater-driven feedbacks on the climate system. Furthermore, we examine the possible opportunities and challenges of using and sustaining groundwater resources in climate adaptation strategies, and highlight the lack of groundwater observations, which, at present, limits our understanding of the dynamic relationship between ground water and climate.

Second-order cone programming

Abstract: Second-order cone programming (SOCP) problems are convex optimization problems in which a linear function is minimized over the intersection of an affine linear manifold with the Cartesian product of second-order (Lorentz) cones. Linear programs, convex quadratic programs and quadratically constrained convex quadratic programs can all be formulated as SOCP problems, as can many other problems that do not fall into these three categories. These latter problems model applications from a broad range of fields from engineering, control and finance to robust optimization and combinatorial optimization. On the other hand semidefinite programming (SDP)—that is the optimization problem over the intersection of an affine set and the cone of positive semidefinite matrices—includes SOCP as a special case. Therefore, SOCP falls between linear (LP) and quadratic (QP) programming and SDP. Like LP, QP and SDP problems, SOCP problems can be solved in polynomial time by interior point methods. The computational effort per iteration required by these methods to solve SOCP problems is greater than that required to solve LP and QP problems but less than that required to solve SDP’s of similar size and structure. Because the set of feasible solutions for an SOCP problem is not polyhedral as it is for LP and QP problems, it is not readily apparent how to develop a simplex or simplex-like method for SOCP. While SOCP problems can be solved as SDP problems, doing so is not advisable both on numerical grounds and computational complexity concerns. For instance, many of the problems presented in the survey paper of Vandenberghe and Boyd [VB96] as examples of SDPs can in fact be formulated as SOCPs and should be solved as such. In §2, 3 below we give SOCP formulations for four of these examples: the convex quadratically constrained quadratic programming (QCQP) problem, problems involving fractional quadratic functions ∗RUTCOR, Rutgers University, e-mail:alizadeh@rutcor.rutgers.edu. Research supported in part by the U.S. National Science Foundation grant CCR-9901991 †IEOR, Columbia University, e-mail: gold@ieor.columbia.edu. Research supported in part by the Department of Energy grant DE-FG02-92ER25126, National Science Foundation grants DMS-94-14438, CDA-97-26385 and DMS-01-04282.