The problem of projecting the origin of Euclidean space onto the convex polyhedron (Q2412941): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q58336420 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: QP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1605.05351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the nearest point in A polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth penalty and subgradient algorithms to solve the problem of projection onto a polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5228664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear separability criterion for sets of Euclidean space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection methods: an annotated bibliography of books and reviews / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Projection Algorithms for Solving Convex Feasibility Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5580053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on strict separability of convex polyhedra and its applications in optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient conditions for emptiness of the cones of generalized support vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relaxation method for certain type of pseudoconvex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical methods in biomedical imaging and intensity-modulated radiation therapy (IMRT). Most papers based on the presentations at the interdisciplinary workshop, Pisa, Italy, October 15--19, 2007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the Point of a Polyhedron Closest to the Origin / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4746738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3408897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4929968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition algorithm for quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4151662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing for quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4120292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3724086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementary pivot theory of mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient matrices and the linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bimatrix Equilibrium Points and Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer experiments on quadratic programming algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4879581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Parallel Nonnegative Least Squares on Multicore Architectures / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:53, 15 July 2024

scientific article
Language Label Description Also known as
English
The problem of projecting the origin of Euclidean space onto the convex polyhedron
scientific article

    Statements

    The problem of projecting the origin of Euclidean space onto the convex polyhedron (English)
    0 references
    0 references
    6 April 2018
    0 references
    projection
    0 references
    convex polyhedron
    0 references
    quadratic programming
    0 references
    maximin problem
    0 references
    complementarity problem
    0 references
    nonnegative least squares problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references