A Polynomial Method of Weighted Centers for Convex Quadratic Programming
DOI10.1080/02522667.1991.10699062zbMATH Open0746.90047OpenAlexW1975279600MaRDI QIDQ3976933FDOQ3976933
Tamás Terlaky, C. Roos, D. Den Hertog
Publication date: 25 June 1992
Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02522667.1991.10699062
Recommendations
- A weighted path-following method for linearly constrained convex programming
- A new primal-dual polynomial algorithm for convex quadratic programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Weighted-path-following algorithm for linear programming
- On the complexity of following the central path of linear programs by linear extrapolation. II
interior point methodsconvex quadratic programmingweighted central path-following methodweighted logarithmic barrier functionweighted trajectories
Quadratic programming (90C20) Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- The Simplex Method for Quadratic Programming
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- Complementary pivot theory of mathematical programming
- Bimatrix Equilibrium Points and Mathematical Programming
- A polynomial-time algorithm for a class of linear complementarity problems
- On \(\ell_ p\) programming
- Boundary Behavior of Interior Point Algorithms in Linear Programming
- A variation on Karmarkar’s algorithm for solving linear programming problems
- A monotonic projective algorithm for fractional linear programming
- Linear quadratic programming in oriented matroids
- New trajectory-following polynomial-time algorithm for linear programming problems
- Title not available (Why is that?)
- A variable dimension algorithm for the linear complementarity problem
Cited In (10)
- A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
- Solving LP Problems via Weighted Centers
- Primal-dual target-following algorithms for linear programming
- Solving nonmonotone affine variational inequalities problem by DC programming and DCA
- The linear complementarity problem, sufficient matrices, and the criss- cross method
- On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
- A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization
- An efficient DCA algorithm for solving non-monotone affine variational inequality problem
- A survey of search directions in interior point methods for linear programming
- On weighted centers for semidefinite programming
This page was built for publication: A Polynomial Method of Weighted Centers for Convex Quadratic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3976933)
