The problem of projecting the origin of Euclidean space onto the convex polyhedron

DOI10.1134/S1995080218010110zbMath1415.90070arXiv1605.05351WikidataQ58336420 ScholiaQ58336420MaRDI QIDQ2412941

Z. R. Gabidullina

Publication date: 6 April 2018

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.05351

zbMATH Keywords

quadratic programmingprojectionconvex polyhedroncomplementarity problemmaximin problemnonnegative least squares problem

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (3)

Adaptive conditional gradient method ⋮ Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets ⋮ Design of the best linear classifier for box-constrained data sets

Uses Software

• QP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear separability criterion for sets of Euclidean space
• A theorem on strict separability of convex polyhedra and its applications in optimization
• Sufficient matrices and the linear complementarity problem
• Computer experiments on quadratic programming algorithms
• Preprocessing for quadratic programming
• The relaxation method for certain type of pseudoconvex programming problems
• Nonsmooth penalty and subgradient algorithms to solve the problem of projection onto a polytope
• Necessary and sufficient conditions for emptiness of the cones of generalized support vectors
• 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
• Complementary pivot theory of mathematical programming
• Efficient Parallel Nonnegative Least Squares on Multicore Architectures
• Projection methods: an annotated bibliography of books and reviews
• A decomposition algorithm for quadratic programming
• Finding the nearest point in A polytope
• Finding the Point of a Polyhedron Closest to the Origin
• On Projection Algorithms for Solving Convex Feasibility Problems
• A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the Variables
• Bimatrix Equilibrium Points and Mathematical Programming

This page was built for publication: The problem of projecting the origin of Euclidean space onto the convex polyhedron