Results 1  10
of
114,327
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
 SIAM Journal on Optimization
, 1993
"... We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to S ..."
Abstract

Cited by 547 (12 self)
 Add to MetaCart
to SDP. Next we present an interior point algorithm which converges to the optimal solution in polynomial time. The approach is a direct extension of Ye's projective method for linear programming. We also argue that most known interior point methods for linear programs can be transformed in a
Rim Sensitivity Analysis From An Interior Solution
, 1996
"... . This establishes theorems about the simultaneous variation of righthand sides and cost coefficients in a linear program from an interior solution. Some results are extensions of those that have been proven for varying the righthand side of the primal or the dual, but not both; other results are ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
. This establishes theorems about the simultaneous variation of righthand sides and cost coefficients in a linear program from an interior solution. Some results are extensions of those that have been proven for varying the righthand side of the primal or the dual, but not both; other results
A NEW POLYNOMIALTIME ALGORITHM FOR LINEAR PROGRAMMING
 COMBINATORICA
, 1984
"... We present a new polynomialtime algorithm for linear programming. In the worst case, the algorithm requires O(tf'SL) arithmetic operations on O(L) bit numbers, where n is the number of variables and L is the number of bits in the input. The running,time of this algorithm is better than the ell ..."
Abstract

Cited by 860 (3 self)
 Add to MetaCart
the ellipsoid algorithm by a factor of O(n~'~). We prove that given a polytope P and a strictly interior point a E P, there is a projective transformation of the space that maps P, a to P', a ' having the following property. The ratio of the radius of the smallest sphere with center a
A Singular Value Thresholding Algorithm for Matrix Completion
, 2008
"... This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a rank minimization problem, and arises in many important applications as in the task of reco ..."
Abstract

Cited by 555 (22 self)
 Add to MetaCart
of recovering a large matrix from a small subset of its entries (the famous Netflix problem). Offtheshelf algorithms such as interior point methods are not directly amenable to large problems of this kind with over a million unknown entries. This paper develops a simple firstorder and easy
The Digital Michelangelo Project: 3D Scanning of Large Statues
, 2000
"... We describe a hardware and software system for digitizing the shape and color of large fragile objects under nonlaboratory conditions. Our system employs laser triangulation rangefinders, laser timeofflight rangefinders, digital still cameras, and a suite of software for acquiring, aligning, merg ..."
Abstract

Cited by 488 (8 self)
 Add to MetaCart
, merging, and viewing scanned data. As a demonstration of this system, we digitized 10 statues by Michelangelo, including the wellknown figure of David, two building interiors, and all 1,163 extant fragments of the Forma Urbis Romae, a giant marble map of ancient Rome. Our largest single dataset
Matrix Sensitivity Analysis from an Interior Solution of a Linear Program
 INFORMS J. Comput
, 1997
"... This paper considers the effect of changing matrix coefficients in a linear program after we have obtained an interior solution. Changes are restricted to where there remains an optimal solution to the perturbed problem (called "admissible "). Mills' minimax theorem provides one appro ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
This paper considers the effect of changing matrix coefficients in a linear program after we have obtained an interior solution. Changes are restricted to where there remains an optimal solution to the perturbed problem (called "admissible "). Mills' minimax theorem provides one
Framing and cooperation in public goods games: An experiment with an interior solution
 Economics Letters
, 1999
"... We show that experimental subjects tend to contribute more to the public good if they perceive the actions of the others as a source of positive externality rather than a source of negative externality. In our experiment partial contribution to the public good is the unique subgame perfect equilibri ..."
Abstract

Cited by 22 (0 self)
 Add to MetaCart
We show that experimental subjects tend to contribute more to the public good if they perceive the actions of the others as a source of positive externality rather than a source of negative externality. In our experiment partial contribution to the public good is the unique subgame perfect equilibrium for the repeated game. Résumé Dans cet article, nous montrons que le degré de coopération de sujets placés dans un mécanisme de contribution volontaire est différent suivant que les choix des sujets induisent des externalités positives (contexte positif) ou des externalités négatives (contexte négatif). Les sujets participant au contexte positif ont un taux de surcontribution supérieur au taux de surcontribution des sujets participant au contexte négatif. Notre expérience se caractérise par une stratégie dominante d’investissement partiel dans le bien public.
Fourdimensional interior solutions from JordanBransDicke Theory of Gravity.
, 2002
"... We study spherically symmetric solutions to the JordanBransDicke field equations under the assumption that the spacetime may possess an arbitrary number of spatial dimensions. Assuming a perfect fluid with the equation of state p = ερ, we show that there are static interior nontrivial solutions i ..."
Abstract
 Add to MetaCart
We study spherically symmetric solutions to the JordanBransDicke field equations under the assumption that the spacetime may possess an arbitrary number of spatial dimensions. Assuming a perfect fluid with the equation of state p = ερ, we show that there are static interior nontrivial solutions
Results 1  10
of
114,327