A row-action method for convex programming
type: Item
instance of: scholarly article
title: A row-action method for convex programming
zbMATH Open document ID: 0823.90099
DOI: 10.1007/BF01582569
author: Alfredo Iusem
author: B. F. Svaiter
published in: Mathematical Programming. Series A. Series B
publication date: 1994-08-10T00:00:00Z
review text: A method of row-action type for the minimizing of a convex program with a strictly convex objective function is presented. At each iteration a subproblem is solved consisting of minimization of the objective function subject to one or two linear equations. Convergence of the algorithm is established and comparisons with other row-action algorithms are maked.
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 617335
zbMATH Keywords: method of row-action type
zbMATH Keywords: strictly convex objective function
reviewed by: Stefan Mititelu
MaRDI profile type: Publication
cites work: Q5580053
cites work: Row-Action Methods for Huge and Sparse Systems and Their Applications
cites work: Cyclic subgradient projections
cites work: A relaxed version of Bregman's method for convex programming
cites work: A finitely convergent ``row-action'' method for the convex feasibility problem
cites work: A successive projection method
cites work: A Parallel Algorithm for a Class of Convex Programs
cites work: Q5528970
cites work: Q3325518
cites work: On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method
cites work: A Simultaneous Iterative Method for Computing Projections on Polyhedra
cites work: On the convergence properties of Hildreth's quadratic programming algorithm
cites work: On the convergence of Han's method for convex programming with quadratic objective
cites work: Extensions of Hildreth’s Row-Action Method for Quadratic Programming
cites work: Convergence of the cyclical relaxation method for linear inequalities
Recommended article: Q4698443
Recommended article: Q4263499
Recommended article: A finitely convergent ``row-action'' method for the convex feasibility problem
Recommended article: Primal-dual row-action method for convex programming
Recommended article: Q3804443
Recommended article: A row relaxation method for large minimax problems
Recommended article: A class of convex programming methods
Recommended article: Q3357432
Recommended article: Q4203723
Recommended article: A Convergent Procedure for Convex Programming
description: scientific article; zbMATH DE number 617335