A regularized interior-point method for constrained linear least squares
From MaRDI portal
Publication:5882390
DOI10.1080/03155986.2018.1559428OpenAlexW2915385707MaRDI QIDQ5882390
Dominique Orban, Mohsen Dehghani, Andrew B. Lambe
Publication date: 15 March 2023
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03155986.2018.1559428
interior-point methodaugmented Lagrangianproximal pointlinear least squaresprimal-dual regularizationsymmetric quasi-definite system
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On iterative algorithms for linear least squares problems with bound constraints
- A primal-dual regularized interior-point method for convex quadratic programs
- Stability analysis of the method of seminormal equations for linear least squares problems
- Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods
- Fine-Grained Multithreading for the Multifrontal $QR$ Factorization of Sparse Matrices
- Computational experience with numerical methods for nonnegative least-squares problems
- Iterative Solution of Symmetric Quasi-Definite Linear Systems
- Regularization and preconditioning of KKT systems arising in nonnegative least-squares problems
- On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions
- An interior point Newton-like method for non-negative least-squares problems with degenerate solution
- Two-Point Step Size Gradient Methods
- On the Implementation of a Primal-Dual Interior Point Method
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Atomic Decomposition by Basis Pursuit
- A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables
- Symmetric Quasidefinite Matrices
- On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems
- Bounds on Eigenvalues of Matrices Arising from Interior-Point Methods
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
