An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set
From MaRDI portal
Publication:1579636
DOI10.1023/A:1004666028951zbMath0986.90028MaRDI QIDQ1579636
Publication date: 16 June 2002
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Uses Software
Cites Work
- A numerically stable dual method for solving strictly convex quadratic programs
- Submodular functions and optimization
- Linearly constrained estimation by mathematical programming
- A practical anti-cycling procedure for linearly constrained optimization
- Resolving degeneracy in quadratic programming
- An interior point algorithm for large scale portfolio optimization
- An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane
- A dual-active-set algorithm for positive semi-definite quadratic programming
- On structures of bisubmodular polyhedra
- Restricted simplicial decomposition for convex constrained problems
- A DUAL ALGORITHM FOR FINDING THE MINIMUM-NORM POINT IN A POLYTOPE
- Equivalence of some quadratic programming algorithms
- On the quadratic programming algorithm of Goldfarb and Idnani
- A FAST ALGORITHM FOR SOLVING LARGE SCALE MEAN-VARIANCE MODELS BY COMPACT FACTORIZATION OF COVARIANCE MATRICES
- A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.
- Finding the nearest point in A polytope
- Simplicial decomposition in nonlinear programming algorithms
- Finding the Point of a Polyhedron Closest to the Origin
- An extension of the frank and Wolfe method of feasible directions
- A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES
- An Efficient Computational Procedure for a Generalized Quadratic Programming Problem
