A reduced Newton method for constrained linear least-squares problems
From MaRDI portal
Recommendations
- Linearized alternating direction method for constrained linear least-squares problem.
- Fast nonnegative least squares through flexible Krylov subspaces
- A new approach to constrained total least squares image restoration
- Nonnegative least-squares image deblurring: improved gradient projection approaches
- A scaled gradient projection method for constrained image deblurring
Cites work
- scientific article; zbMATH DE number 1465025 (Why is no real title available?)
- scientific article; zbMATH DE number 2118874 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Fast Algorithm for Deblurring Models with Neumann Boundary Conditions
- A Fast Total Variation Minimization Method for Image Restoration
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
- An Introduction to Iterative Toeplitz Solvers
- An active set-type Newton method for constrained nonlinear systems
- An affine-scaling interior-point CBB method for box-constrained optimization
- An interior point Newton-like method for non-negative least-squares problems with degenerate solution
- An iterative method for linear discrete ill-posed problems with box constraints
- Computational experience with numerical methods for nonnegative least-squares problems.
- Computing non-negative tensor factorizations
- Interactive decision support in radiation therapy treatment planning
- Nonlinear total variation based noise removal algorithms
- Nonnegativity constraints in numerical analysis
- On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
- Regularization and preconditioning of KKT systems arising in nonnegative least-squares problems
- Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
- Trust Region Methods
Cited in
(19)- On efficiency of nonmonotone Armijo-type line searches
- A modulus-based multigrid method for image retinex
- Dual-primal algorithm for linear optimization
- An implementable splitting algorithm for the _1-norm regularized split feasibility problem
- Approximate first-order primal-dual algorithms for saddle point problems
- Unified linear convergence of first-order primal-dual algorithms for saddle point problems
- On preconditioned and relaxed AVMM methods for quadratic programming problems with equality constraints
- A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems
- A partially inertial customized Douglas-Rachford splitting method for a class of structured optimization problems
- Sparse solution of nonnegative least squares problems with applications in the construction of probabilistic Boolean networks.
- Accelerated Uzawa methods for convex optimization
- A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
- Linearized alternating direction method for constrained linear least-squares problem.
- Positively constrained total variation penalized image restoration
- Variational image restoration with constraints on noise whiteness
- An optimal subgradient algorithm for large-scale bound-constrained convex optimization
- Conditional gradient Tikhonov method for a convex optimization problem in image restoration
- An iterative substructuring algorithm for equilibrium equations
- Hybrid variational model based on alternating direction method for image restoration
This page was built for publication: A reduced Newton method for constrained linear least-squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847169)
