Deciding uniqueness in norm maximazation

DOI10.1007/BF01581081zbMATH Open0789.90090MaRDI QIDQ687086FDOQ687086

Authors: Peter Gritzmann, Victor Klee 

Publication date: 12 June 1994

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Recommendations

• Computational complexity of norm-maximization
• A Variable-Complexity Norm Maximization Problem
• Geometric optimization problems likely not contained in \(\mathbb A\mathbb P\mathbb X\)
• \(\mathbb N\mathbb P\)-hardness of largest contained and smallest containing simplices for \(V\)- and \(H\)-polytopes
• Uniqueness in quadratic and hyperbolic \(0-1\) programming problems

zbMATH Keywords

polytopeNP-hardnesssystem of linear inequalities

Mathematics Subject Classification ID

Quadratic programming (90C20) Convex programming (90C25) Nonlinear programming (90C30) Abstract computational complexity for mathematical programming problems (90C60) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)

Cites Work

• Title not available (Why is that?)
• Some NP-complete problems in quadratic and nonlinear programming
• The complexity of optimization problems
• Title not available (Why is that?)
• NP is as easy as detecting unique solutions
• Complexity of uniqueness and local search in quadratic 0-1 programming
• Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces
• Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
• Title not available (Why is that?)
• On the complexity of unique solutions
• Computational complexity of norm-maximization

Cited In (8)

• A Variable-Complexity Norm Maximization Problem
• Uniqueness in quadratic and hyperbolic \(0-1\) programming problems
• Largest \(j\)-simplices in \(n\)-polytopes
• Computational complexity of norm-maximization
• Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem
• Polynomial norms
• On the complexity of some basic problems in computational convexity. I. Containment problems
• Title not available (Why is that?)

This page was built for publication: Deciding uniqueness in norm maximazation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q687086)