An iterative method, having linear rate of convergence, for solving a pair of dual linear programs

DOI10.1007/BF01585003zbMath0259.90019OpenAlexW2055575024MaRDI QIDQ5675136

Werner Oettli

Publication date: 1972

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01585003

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

• Symmetric dual quadratic programs
• Gradient methods for solving equations and inequalities
• The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
• The Relaxation Method for Linear Inequalities
• Unnamed Item
• Unnamed Item
• Unnamed Item

Related Items (16)

About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. II ⋮ About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. I ⋮ Geometrically convergent projection method in matrix games ⋮ The gap function of a convex program ⋮ Iterative solution of convex problems by fejer-monotone methods ⋮ Time-dependent traffic equilibria ⋮ A method for approximating the solution set of a system of convex inequalities by polytopes ⋮ An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem ⋮ Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraints ⋮ Convergence of the cyclical relaxation method for linear inequalities ⋮ On convergence rates of subgradient optimization methods ⋮ Minimization methods with constraints ⋮ A primal-dual subgradient method for time staged capacity expansion planning ⋮ Decomposition through formalization in a product space ⋮ Validation of subgradient optimization ⋮ Variational inequalities and discrete and continuum models of network equilibrium problems

This page was built for publication: An iterative method, having linear rate of convergence, for solving a pair of dual linear programs