A convergence analysis for a convex version of Dikin's algorithm
From MaRDI portal
Publication:1915918
DOI10.1007/BF02206823zbMath0848.90101MaRDI QIDQ1915918
Publication date: 1 July 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
interior point methods\(\varepsilon\)-optimal solutionDikin's algorithmlinearly constrained smooth convex programssecond-order approximation of the objective function
Related Items (14)
Analysis of some interior point continuous trajectories for convex programming ⋮ An augmented Lagrangian affine scaling method for nonlinear programming ⋮ On the price of anarchy for non-atomic congestion games under asymmetric cost maps and elastic demands ⋮ Trust region affine scaling algorithms for linearly constrained convex and concave programs ⋮ A trust region affine scaling method for bound constrained optimization ⋮ The toll effect on price of anarchy when costs are nonlinear and asymmetric ⋮ New bounds for the price of anarchy under nonlinear and asymmetric costs ⋮ A first-order interior-point method for linearly constrained smooth optimization ⋮ Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization ⋮ A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming ⋮ Stackelberg strategies for selfish routing in general multicommodity networks ⋮ A trust region method based on a new affine scaling technique for simple bounded optimization ⋮ Bounds on price of anarchy on linear cost functions ⋮ An interior point parameterized central path following algorithm for linearly constrained convex programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modification of Karmarkar's linear programming algorithm
- An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming
- A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions
- On affine scaling algorithms for nonconvex quadratic programming
- On the convergence of the affine-scaling algorithm
- A simplified global convergence proof of the affine scaling algorithm
- The use of lower bounds in minimization by the interior-point method
- A variation on Karmarkar’s algorithm for solving linear programming problems
- Cancellation Errors in Quasi-Newton Methods
- Insights into the interior-point methods
- Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
- Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
- Convex Analysis
This page was built for publication: A convergence analysis for a convex version of Dikin's algorithm
