A sequential ascending parameter method for solving constrained minimization problems

DOI10.1137/100800580zbMATH Open1269.90076OpenAlexW1976680771MaRDI QIDQ2902879FDOQ2902879

Authors: Amir Beck, Aharon Ben-Tal, Luba Tetruashvili 

Publication date: 22 August 2012

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/869dad6978986ec85134d2420e88f77ac9aac148

Recommendations

• On solving convex optimization problems with linear ascending constraints
• Incremental subgradients for constrained convex optimization: A unified framework and new methods
• A scaled gradient projection method for constrained image deblurring
• The CoMirror algorithm for solving nonsmooth constrained convex problems
• Publication:3199206

zbMATH Keywords

convex optimizationimage deblurringlinear rate of convergenceoptimal gradient methods

Mathematics Subject Classification ID

Convex programming (90C25) Minimax problems in mathematical programming (90C47)

Cited In (1)

• A level-set method for convex optimization with a feasible solution path

This page was built for publication: A sequential ascending parameter method for solving constrained minimization problems

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