Exterior point algorithms for nearest points and convex quadratic programs
From MaRDI portal
Recommendations
- A new penalty function algorithm for convex quadratic programming
- An exterior point polynomial-time algorithm for convex quadratic programming
- An interior-exterior approach for convex quadratic programming
- The nearest point problem in a polyhedral set and its extensions
- A Newton Based Radius Reduction Algorithm for Nearest Point Problems in Pos Cones
Cites work
- scientific article; zbMATH DE number 446508 (Why is no real title available?)
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 4193461 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3332061 (Why is no real title available?)
- A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.
- A critical index algorithm for nearest point problems on simplicial cones
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm for a class of linear complementarity problems
- A polynomial-time algorithm, based on Newton's method, for linear programming
- An Exact Potential Method for Constrained Maxima
- An algorithm for linear least squares problems with equality and nonnegativity constraints
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- Bimatrix Equilibrium Points and Mathematical Programming
- Exact penalty functions in nonlinear programming
- Finding the nearest point in A polytope
- Note on Finite Convergence of Exterior Penalty Functions
- The steepest descent gravitational method for linear programming
Cited in
(17)- Exterior point simplex-type algorithms for linear and network optimization problems
- On using exterior penalty approaches for solving linear programming problems
- Exact SDP reformulations for adjustable robust quadratic optimization with affine decision rules
- An exterior point method for the convex programming problem
- A semi-smooth Newton method for a special piecewise linear system with application to positively constrained convex quadratic programming
- Extremal point queries with lines and line segments and related problems
- A vertex algorithm for collision detection
- Error bounds for solutions of linear equations and inequalities
- An exterior point polynomial-time algorithm for convex quadratic programming
- The nearest point problem in a polyhedral set and its extensions
- A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming
- A new penalty function algorithm for convex quadratic programming
- Improving a primal–dual simplex-type algorithm using interior point methods
- scientific article; zbMATH DE number 710572 (Why is no real title available?)
- Projection onto simplicial cones by a semi-smooth Newton method
- On second-order conic programming duals for robust convex quadratic optimization problems
- Projection onto simplicial cones by Picard's method
This page was built for publication: Exterior point algorithms for nearest points and convex quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q687081)
