A normal fan projection algorithm for low-rank optimization
From MaRDI portal
(Redirected from A normal fan projection algorithm for low-rank optimization)
Cites work
- \(NP\)-hardness of linear multiplicative programming and related problems
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
- A Lower Bound for Adjacencies on the Traveling Salesman Polytope
- A New Algorithm for Enumeration of Cells of Hyperplane Arrangements and a Comparison with Avis and Fukuda's Reverse Search
- A polynomial case of unconstrained zero-one quadratic optimization
- Adjacency on polymatroids
- An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set
- An FPTAS for optimizing a class of low-rank functions over a polytope
- Approximation algorithms for indefinite quadratic programming
- Approximation algorithms for reliable stochastic combinatorial optimization
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Computational geometric approach to submodular function minimization for multiclass queueing systems
- Concave minimization under linear constraints with special structure
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function
- Cutting plane/tabu search algorithms for low rank concave quadratic programming problems
- Cutting Planes for Low-Rank-Like Concave Minimization Problems
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- Learning with submodular functions: a convex optimization perspective
- Lectures on Polytopes
- Methods for Global Concave Minimization: A Bibliographic Survey
- Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient
- On the Assignment Polytope
- Polymatroid greedoids
- Quadratic programming and combinatorial minimum weight product problems
- Quadratic programming with one negative eigenvalue is NP-hard
- Reverse search for enumeration
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
This page was built for publication: A normal fan projection algorithm for low-rank optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6665394)
