An active index algorithm for the nearest point problem in a polyhedral cone

DOI10.1007/s10589-009-9303-0zbMath1222.90042OpenAlexW1998488583WikidataQ57435687 ScholiaQ57435687MaRDI QIDQ548684

Zhe Liu, Yahya Fathi

Publication date: 30 June 2011

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-009-9303-0

zbMATH Keywords

quadratic programmingactive constraintpos coneprojection face

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20)

Related Items

Fundamentals of cone regression, An algorithm for projecting onto simplicial cones, The nearest point problem in a polyhedral set and its extensions, The distance between convex sets with Minkowski sum structure: application to collision detection, A semi-smooth Newton method for a special piecewise linear system with application to positively constrained convex quadratic programming, Projection onto simplicial cones by a semi-smooth Newton method, Projection onto simplicial cones by Picard's method

Uses Software

• CONV_QP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A numerically stable dual method for solving strictly convex quadratic programs
• CONV_QP
• A long-step barrier method for convex quadratic programming
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• A successive projection method
• A modified projection algorithm for large strictly-convex quadratic programs
• An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
• A critical index algorithm for nearest point problems on simplicial cones
• An iterative method for generalized complementarity problems
• A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.
• Finding the nearest point in A polytope
• Bimatrix Equilibrium Points and Mathematical Programming