A row-action method for convex programming

DOI10.1007/BF01582569zbMath0823.90099MaRDI QIDQ1330898

Alfredo Noel Iusem, Benar Fux Svaiter

Publication date: 10 August 1994

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

method of row-action typestrictly convex objective function

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Related Items

Primal-dual row-action method for convex programming ⋮ Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. ⋮ A new duality theory for mathematical programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the convergence properties of Hildreth's quadratic programming algorithm
• A relaxed version of Bregman's method for convex programming
• A finitely convergent ``row-action method for the convex feasibility problem
• On the convergence of Han's method for convex programming with quadratic objective
• A successive projection method
• Convergence of the cyclical relaxation method for linear inequalities
• A Simultaneous Iterative Method for Computing Projections on Polyhedra
• A Parallel Algorithm for a Class of Convex Programs
• Extensions of Hildreth’s Row-Action Method for Quadratic Programming
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Cyclic subgradient projections
• On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method