On Long Step Path Following and SUMT for Linear and Quadratic Programming
From MaRDI portal
Publication:4877504
DOI10.1137/0806003zbMATH Open0852.90105OpenAlexW1965660560MaRDI QIDQ4877504FDOQ4877504
Authors: Kurt M. Anstreicher 
Publication date: 13 May 1996
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0806003
Recommendations
- Long-step path-following algorithm for convex quadratic programming problems in a Hilbert space
- On the long-step path-following method for semidefinite programming
- scientific article; zbMATH DE number 1182576
- A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming
- A long step primal-dual path-following algorithm for convex quadratic semidefinite programming
- Long-step path-following algorithm for solving symmetric programming problems with nonlinear objective functions
- On the generalized path-following methods for linear programming
- Path-Following Methods for Linear Programming
- scientific article; zbMATH DE number 934836
- A Path-Following Algorithm for Linear Programming Using Quadratic and Logarithmic Penalty Functions
sequential unconstrained minimizationlinear inequality constraintsconvex quadratic objectivelong step barrier algorithmlong step path following
Cited In (6)
- Interior-point methods: An old and new approach to nonlinear programming
- A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming
- Title not available (Why is that?)
- Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem
- Logarithmic SUMT limits in convex programming
- Title not available (Why is that?)
This page was built for publication: On Long Step Path Following and SUMT for Linear and Quadratic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4877504)
