A regularized interior-point method for constrained linear least squares
From MaRDI portal
Publication:5882390
DOI10.1080/03155986.2018.1559428OpenAlexW2915385707MaRDI QIDQ5882390FDOQ5882390
Authors: Mohsen Dehghani, Andrew B. Lambe, D. Orban 
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
Recommendations
- A regularization method for constrained nonlinear least squares
- A globally convergent regularized interior point method for constrained optimization
- scientific article; zbMATH DE number 125935
- An Interior-Point Algorithm for Linearly Constrained Optimization
- Regularization techniques in interior point methods
- An interior point method for constrained saddle point problems
- A primal-dual interior-point algorithm for nonlinear least squares constrained problems
- A Constrained Least Squares Regularization Method for Nonlinear III-Posed Problems
- An interior point method for linear programming
- scientific article; zbMATH DE number 4031392
augmented Lagrangianinterior-point methodlinear least squaresproximal pointprimal-dual regularizationsymmetric quasi-definite system
Cites Work
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- On the Implementation of a Primal-Dual Interior Point Method
- Atomic Decomposition by Basis Pursuit
- Symmetric Quasidefinite Matrices
- Title not available (Why is that?)
- Two-Point Step Size Gradient Methods
- Title not available (Why is that?)
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Title not available (Why is that?)
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Title not available (Why is that?)
- A primal-dual regularized interior-point method for convex quadratic programs
- Bounds on Eigenvalues of Matrices Arising from Interior-Point Methods
- An interior-point method for large-scale \(l_1\)-regularized logistic regression
- An interior point Newton-like method for non-negative least-squares problems with degenerate solution
- A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables
- On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems
- On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions
- On iterative algorithms for linear least squares problems with bound constraints
- Regularization and preconditioning of KKT systems arising in nonnegative least-squares problems
- Iterative solution of symmetric quasi-definite linear systems
- Stability analysis of the method of seminormal equations for linear least squares problems
- Computational experience with numerical methods for nonnegative least-squares problems.
- Fine-grained multithreading for the multifrontal \(QR\) factorization of sparse matrices
- Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods
Cited In (7)
- A regularization method for constrained nonlinear least squares
- \(\mathcal{N}\)IPM-HLSP: an efficient interior-point method for hierarchical least-squares programs
- The effect of regularization on drug-reaction relationships
- Trust-region and other regularisations of linear least-squares problems
- A globally convergent regularized interior point method for constrained optimization
- Regularized optimization methods with finite-step interior algorithms
- Title not available (Why is that?)
Uses Software
This page was built for publication: A regularized interior-point method for constrained linear least squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5882390)
