Results 1  10
of
15
New Lower Bounds for Convex Hull Problems in Odd Dimensions
 SIAM J. Comput
, 1996
"... We show that in the worst case, Ω(n dd=2e\Gamma1 +n log n) sidedness queries are required to determine whether the convex hull of n points in R^d is simplicial, or to determine the number of convex hull facets. This lower bound matches known upper bounds in any odd dimension. Our result fo ..."
Abstract

Cited by 27 (7 self)
 Add to MetaCart
We show that in the worst case, &Omega;(n dd=2e\Gamma1 +n log n) sidedness queries are required to determine whether the convex hull of n points in R^d is simplicial, or to determine the number of convex hull facets. This lower bound matches known upper bounds in any odd dimension. Our result follows from a straightforward adversary argument. A key step in the proof is the construction of a quasisimplicial nvertex polytope with &Omega;(n dd=2e\Gamma1 ) degenerate facets. While it has been known for several years that ddimensional convex hulls can have &Omega;(n bd=2c ) facets, the previously best lower bound for these problems is only &Omega;(n log n). Using similar techniques, we also obtain simple and correct proofs of Erickson and Seidel's lower bounds for detecting affine degeneracies in arbitrary dimensions and circular degeneracies in the plane. As a related result, we show that detecting simplicial convex hulls in R^d is &lceil;d/2&rceil;hard, in the in the sense of Gajentaan and Overmars.
Some Algorithmic Problems in Polytope Theory
 IN ALGEBRA, GEOMETRY, AND SOFTWARE SYSTEMS
, 2003
"... Convex polytopes, i.e.. the intersections of finitely many closed affine halfspaces in R^d, are important objects in various areas of mathematics and other disciplines. In particular, the compact... ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
Convex polytopes, i.e.. the intersections of finitely many closed affine halfspaces in R^d, are important objects in various areas of mathematics and other disciplines. In particular, the compact...
Lower Bounds for Fundamental Geometric Problems
 IN 5TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA'97
, 1996
"... We develop lower bounds on the number of primitive operations required to solve several fundamental problems in computational geometry. For example, given a set of points in the plane, are any three colinear? Given a set of points and lines, does any point lie on a line? These and similar question ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
We develop lower bounds on the number of primitive operations required to solve several fundamental problems in computational geometry. For example, given a set of points in the plane, are any three colinear? Given a set of points and lines, does any point lie on a line? These and similar questions arise as subproblems or special cases of a large number of more complicated geometric problems, including point location, range searching, motion planning, collision detection, ray shooting, and hidden surface removal. Previously these problems were studied only in general models of computation, but known techniques for these models are too weak to prove useful results. Our approach is to consider, for each problem, a more specialized model of computation that is still rich enough to describe all known algorit...
Nonlinear Bipartite Matching
 DISC. OPTIM
, 2008
"... We study the problem of optimizing nonlinear objective functions over bipartite matchings. While the problem is generally intractable, we provide several efficient algorithms for it, including a deterministic algorithm for maximizing convex objectives, approximative algorithms for norm minimization ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
We study the problem of optimizing nonlinear objective functions over bipartite matchings. While the problem is generally intractable, we provide several efficient algorithms for it, including a deterministic algorithm for maximizing convex objectives, approximative algorithms for norm minimization and maximization, and a randomized algorithm for optimizing arbitrary objectives.
On the epsilonperturbation Method for Avoiding Degeneracy
 IBM Almaden Research
, 1988
"... . Although it is NPcomplete to decide whether a linear programming problemis degenerate, the fflperturbation method can be used to reduce in polynomial time any linear programming problemwith rational coefficients to a nondegenerate problem. The perturbed problem has the same status as the given o ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
. Although it is NPcomplete to decide whether a linear programming problemis degenerate, the fflperturbation method can be used to reduce in polynomial time any linear programming problemwith rational coefficients to a nondegenerate problem. The perturbed problem has the same status as the given one in terms of feasibility and unboundedness, and optimal bases of the perturbed problem are optimal in the given problem. Keywords: linear programming, polynomialtime, perturbation, degeneracy. OR/MS Index: 650 1. Introduction Degenerate problems cause some inconvenience in the practice as well as in the theory of linear programming. However, in this note we are interested only in the theoretical side. Many methods are known for avoiding the evils caused by degeneracy in the context of the simplex method (see, for example, Murty [3]). When a new algorithm is proposed, the analysis is often complicated by the need to address degeneracy, and results are sometimes proved under a nondegenerac...
Complementarity Problems
 J. Comput. Appl. Math
, 2000
"... This paper provides an introduction to complementarity problems, with an emphasis on applications and solution algorithms. Various forms of complementarity problems are described along with a few sample applications, which provide a sense of what types of problems can be addressed eectively with ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
This paper provides an introduction to complementarity problems, with an emphasis on applications and solution algorithms. Various forms of complementarity problems are described along with a few sample applications, which provide a sense of what types of problems can be addressed eectively with complementarity problems. The most important algorithms are presented along with a discussion of when they can be used eectively. We also provide a brief introduction to the study of matrix classes and their relation to linear complementarity problems. Finally, we provide a brief summary of current research trends. Key words: complementarity problems,variational inequalities, matrix classes 1 Introduction The distinguishing feature of a complementarity problem is the set of complementarity conditions. Each of these conditions requires that the product of two or more nonnegative quantities should be zero. (Here, each quantity is either a decision variable, or a function of the decisi...
CoNPCompleteness of Some Matrix Classification Problems
, 1999
"... The classes of P , P 0 , R 0 , semimonotone, strictly semimonotone, column sufficient, and nondegenerate matrices play important roles in studying solution properties of equations and complementarity problems and convergence /complexity analysis of methods for solving these problems. It is known ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The classes of P , P 0 , R 0 , semimonotone, strictly semimonotone, column sufficient, and nondegenerate matrices play important roles in studying solution properties of equations and complementarity problems and convergence /complexity analysis of methods for solving these problems. It is known that the problem of deciding whether a square matrix with integer/rational entries is a P  (or nondegenerate) matrix is coNPcomplete. We show, through a unified analysis, that analogous decision problems for the other matrix classes are also coNPcomplete. Key words. P , P 0 , R 0 , semimonotone, strictly semimonotone, column sufficient, nondegenerate matrices, complementarity problems, 1norm maximzation, NP completeness. This research is supported by National Science Foundation Grant CCR9731273. y Department of Mathematics, University of Washington, Seattle, WA 98195, U.S.A. Email: tseng@math.washington.edu. 1 Introduction There are a number of matrix classes, in addition t...
SignSolvable Linear Complementarity Problems
, 2006
"... The METR technical reports are published as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electron ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The METR technical reports are published as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author’s copyright. These works may not be reposted without the explicit permission of the copyright holder.
On the Complexity of Deciding Degeneracy in Games
, 2009
"... We show that it is NPComplete to decide whether a bimatrix game is degenerate and it is CoNPComplete to decide whether a bimatrix game is nondegenerate. 1 ..."
Abstract
 Add to MetaCart
We show that it is NPComplete to decide whether a bimatrix game is degenerate and it is CoNPComplete to decide whether a bimatrix game is nondegenerate. 1
On the ɛperturbation Method for Avoiding Degeneracy
"... Although it is NPcomplete to decide whether a linear programming problem is degenerate, the ɛperturbation method can be used to reduce in polynomial time any linear programming problem with rational coefficients to a nondegenerate problem. The perturbed problem has the same status as the giv ..."
Abstract
 Add to MetaCart
Although it is NPcomplete to decide whether a linear programming problem is degenerate, the ɛperturbation method can be used to reduce in polynomial time any linear programming problem with rational coefficients to a nondegenerate problem. The perturbed problem has the same status as the given one in terms of feasibility and unboundedness, and optimal bases of the perturbed problem are optimal in the given problem.