Exterior point algorithms for nearest points and convex quadratic programs
From MaRDI portal
Publication:687081
DOI10.1007/BF01581078zbMath0787.90066MaRDI QIDQ687081
Khaled S. Al-Sultan, Katta G. Murty
Publication date: 20 December 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Error bounds for solutions of linear equations and inequalities, On second-order conic programming duals for robust convex quadratic optimization problems, Exterior point simplex-type algorithms for linear and network optimization problems, Improving a primal–dual simplex-type algorithm using interior point methods, A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming, On using exterior penalty approaches for solving linear programming problems, A semi-smooth Newton method for a special piecewise linear system with application to positively constrained convex quadratic programming, A new penalty function algorithm for convex quadratic programming, A vertex algorithm for collision detection, An exterior point polynomial-time algorithm for convex quadratic programming, Projection onto simplicial cones by a semi-smooth Newton method, Projection onto simplicial cones by Picard's method
Cites Work
- The steepest descent gravitational method for linear programming
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- A polynomial-time algorithm for a class of linear complementarity problems
- An algorithm for linear least squares problems with equality and nonnegativity constraints
- A critical index algorithm for nearest point problems on simplicial cones
- Note on Finite Convergence of Exterior Penalty Functions
- 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
- An Exact Potential Method for Constrained Maxima
- Exact penalty functions in nonlinear programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item