Solving trust-region subproblem augmented with linear inequality constraints

DOI10.1080/10556788.2011.582501zbMath1270.90070OpenAlexW1981188997MaRDI QIDQ4924102

Ørjan Bergmann, Trond Steihaug

Publication date: 30 May 2013

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2011.582501

zbMATH Keywords

regularizationconstrained optimizationimage processing

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs

Cites Work

• Fast methods for MR spectroscopic imaging
• An algorithm for image denoising with automatic noise estimate
• An interior-point method for large constrained discrete ill-posed problems
• Quasi-Newton approach to nonnegative image restorations
• A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem
• Accelerating the LSTRS Algorithm
• Computing a Trust Region Step
• Positive solutions to linear inverse problems
• Numerical Optimization
• Projected Landweber method and preconditioning
• An interior-point trust-region-based method for large-scale non-negative regularization
• Matrix-free algorithm for the large-scale constrained trust-region subproblem