PNKH-B: A Projected Newton--Krylov Method for Large-Scale Bound-Constrained Optimization
From MaRDI portal
Publication:5161766
DOI10.1137/20M1341428MaRDI QIDQ5161766
Samy Wu Fung, Kelvin K. Kan, Lars Ruthotto
Publication date: 1 November 2021
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.13639
parameter estimationlarge-scale optimizationmachine learningbound-constrained optimizationprojected Newton-Krylov methods
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved Newton projection method for nonnegative deblurring of Poisson-corrupted images with Tikhonov regularization
- A projected Newton-CG method for nonnegative astronomical image deblurring
- A class of methods for solving large, convex quadratic programs subject to box constraints
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
- A multiscale method for model order reduction in PDE parameter estimation
- NPtool: a MATLAB software for nonnegative image restoration with Newton projection methods
- Deep neural networks motivated by partial differential equations
- ADMM-softmax: an ADMM approach for multinomial logistic regression
- A two-stage method for spectral-spatial classification of hyperspectral images
- Steplength selection in interior-point methods for quadratic programming
- Proximal Newton-Type Methods for Minimizing Composite Functions
- Computational Methods in Geophysical Electromagnetics
- Introduction to Nonlinear Optimization
- Remark on “algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization”
- Fast Algorithms for Bayesian Uncertainty Quantification in Large-Scale Linear Inverse Problems Based on Low-Rank Partial Hessian Approximations
- 10.1162/15324430260185619
- Two-Metric Projection Methods for Constrained Optimization
- A New Active Set Algorithm for Box Constrained Optimization
- Newton’s Method and the Goldstein Step-Length Rule for Constrained Minimization Problems
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- Interior-Point Methods for Massive Support Vector Machines
- Stable architectures for deep neural networks
- Projected Newton Methods for Optimization Problems with Simple Constraints
- A Limited Memory Algorithm for Bound Constrained Optimization
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
- Multigrid Optimization for Large-Scale Ptychographic Phase Retrieval
- Tackling Box-Constrained Optimization via a New Projected Quasi-Newton Approach
- On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence
- Nonconvex Optimization for 3-Dimensional Point Source Localization Using a Rotating Point Spread Function
- An Uncertainty-Weighted Asynchronous ADMM Method for Parallel PDE Parameter Estimation
- Spectral Computed Tomography with Linearization and Preconditioning
- jInv--a Flexible Julia Package for PDE Parameter Estimation
- Nonlinear optimization for mixed attenuation polyenergetic image reconstruction
