From convex feasibility to convex constrained optimization using block action projection methods and underrelaxation

DOI10.1111/j.1475-3995.2009.00693.xzbMath1190.49037OpenAlexW2027413213MaRDI QIDQ3563616

Elias Salomão Helou Neto, Alvaro Rodolfo de Pierro

Publication date: 31 May 2010

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2009.00693.x

zbMATH Keywords

constrained optimizationprojection methodsconvex feasibility

Mathematics Subject Classification ID

Convex programming (90C25) Newton-type methods (49M15)

Related Items (3)

A generalized projection-based scheme for solving convex constrained optimization problems ⋮ On perturbed steepest descent methods with inexact line search for bilevel convex optimization ⋮ A method for solving some optimization problems with bounds on variables

Cites Work

• Unnamed Item
• A relaxed version of Bregman's method for convex programming
• Strong underrelaxation in Kaczmarz's method for inconsistent systems
• On the convergence of von Neumann's alternating projection algorithm for two sets
• Steered sequential projections for the inconsistent convex feasibility problem
• Convergence results for scaled gradient algorithms in positron emission tomography
• Extensions of Hildreth’s Row-Action Method for Quadratic Programming
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• On Projection Algorithms for Solving Convex Feasibility Problems

This page was built for publication: From convex feasibility to convex constrained optimization using block action projection methods and underrelaxation