Primal-dual row-action method for convex programming
From MaRDI portal
Publication:1904955
DOI10.1007/BF02193462zbMath0838.90093MaRDI QIDQ1904955
Alfredo Noel Iusem, Benar Fux Svaiter
Publication date: 15 January 1996
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Related Items
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
- 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
- A row-action method for convex programming
- Convergence of the cyclical relaxation method for linear inequalities
- A Parallel Algorithm for a Class of Convex Programs
- The Relaxation Method for Solving Systems of Linear Inequalities
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
- Cyclic subgradient projections
- On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method
