Computational complexity of norm-maximization
DOI10.1007/BF02123011zbMATH Open0722.90080DBLPjournals/combinatorica/BodlaenderGKL90OpenAlexW2022029673WikidataQ59568056 ScholiaQ59568056MaRDI QIDQ757258FDOQ757258
Authors: Hans L. Bodlaender, Peter Gritzmann, Victor Klee, J. Van Leeuwen 
Publication date: 1990
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02123011
Recommendations
Abstract computational complexity for mathematical programming problems (90C60) Complexity of computation (including implicit computational complexity) (03D15)
Cites Work
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- Some NP-complete problems in quadratic and nonlinear programming
- A Compactness Theorem For Affine Equivalence-Classes of Convex Regions
- Constrained global optimization: algorithms and applications
- Polynomial algorithms in linear programming
- The complexity of satisfiability problems
- The maximum numbers of faces of a convex polytope
- A polynomial-time algorithm for a class of linear complementarity problems
- `` Strong NP-Completeness Results
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- A Variable-Complexity Norm Maximization Problem
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- A solvable case of quadratic 0-1 programming
- The basic algorithm for pseudo-Boolean programming revisited
- MAXIMIZING A CONVEX QUADRATIC FUNCTION OVER A HYPERCUBE
- 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 four polyhedral set containment problems
- Finding the convex hull facet by facet
- Unimodular functions
- Extreme varieties, concave functions, and the fixed charge problem
- Quasimonotone Boolean Functions and Bistellar Graphs
- Hyperrhombs inscribed to convex bodies
- Title not available (Why is that?)
- The Complexity of Vertex Enumeration Methods
- Title not available (Why is that?)
- Beliebige konvexe Polytope als Schnitte und Projektionen höherdimensionaler Würfel, Simplizes und Masspolytope
- Algorithmes de calcul du maximum des formes quadratiques sur la boule unité de la norme du max
Cited In (25)
- Deterministic and randomized polynomial‐time approximation of radii
- A Variable-Complexity Norm Maximization Problem
- Deciding uniqueness in norm maximazation
- Two classes of games on polyhedral sets in systems economic studies
- The computational complexity of maximization and integration
- Fixed-parameter complexity and approximability of norm maximization
- Geometric optimization problems likely not contained in \(\mathbb A\mathbb P\mathbb X\)
- Distributionally Robust Linear and Discrete Optimization with Marginals
- Title not available (Why is that?)
- The computational complexity of duality
- Largest \(j\)-simplices in \(n\)-polytopes
- Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces
- Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem
- On the entropy of couplings
- Complexity of unconstrained \(L_2 - L_p\) minimization
- On clustering bodies: geometry and polyhedral approximation
- Computing the norm ∥A∥∞,1 is NP-hard∗
- On the co-NP-completeness of the zonotope containment problem
- Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
- Polynomial norms
- Gradient free cooperative seeking of a moving source
- Complexity results for some global optimization problems
- Novel approaches to the discrimination problem
- 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: Computational complexity of norm-maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757258)
