A row-action method for convex programming

DOI10.1007/BF01582569MaRDI QIDQ1330898zbMATH OpenFDO

Authors Alfredo Iusem, B. F. 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)

Recommendations

• scientific article; zbMATH DE number 751235
• scientific article; zbMATH DE number 1341934
• A finitely convergent ``row-action method for the convex feasibility problem
• Primal-dual row-action method for convex programming
• scientific article; zbMATH DE number 4072707
• A row relaxation method for large minimax problems
• A class of convex programming methods
• scientific article; zbMATH DE number 4209464
• Publication:4203723
• A Convergent Procedure for Convex Programming

Cites work

• scientific article; zbMATH DE number 3856876 (Why is no real title available?)
• scientific article; zbMATH DE number 3241658 (Why is no real title available?)
• scientific article; zbMATH DE number 3296905 (Why is no real title available?)
• A Parallel Algorithm for a Class of Convex Programs
• A Simultaneous Iterative Method for Computing Projections on Polyhedra
• A finitely convergent ``row-action method for the convex feasibility problem
• A relaxed version of Bregman's method for convex programming
• A successive projection method
• Convergence of the cyclical relaxation method for linear inequalities
• Cyclic subgradient projections
• Extensions of Hildreth’s Row-Action Method for Quadratic Programming
• On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method
• On the convergence of Han's method for convex programming with quadratic objective
• On the convergence properties of Hildreth's quadratic programming algorithm
• Row-Action Methods for Huge and Sparse Systems and Their Applications

Cited in

(6)

• Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.
• A new duality theory for mathematical programming
• A linear acceleration row action method for projecting onto subspaces
• On the convergence of row-modification algorithm for matrix projections
• Primal-dual row-action method for convex programming
• A finitely convergent ``row-action method for the convex feasibility problem

This page was built for publication: A row-action method for convex programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1330898)