A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils
DOI10.3934/jimo.2020073zbMath1476.65095OpenAlexW3023807306MaRDI QIDQ2666658
Zhou-Hong Wang, Yu-Hong Dai, Feng-Min Xu
Publication date: 23 November 2021
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2020073
numerical stabilityanalytic centerinterior point algorithmill-conditionBoltzmann's entropyneutron spectrum unfolding
Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical mathematical programming methods (65K05) Interior-point methods (90C51)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A scaling technique for finding the weighted analytic center of a polytope
- A primal-dual infeasible-interior-point algorithm for linear programming
- Polynomiality of infeasible-interior-point algorithms for linear programming
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- A trust region-CG algorithm for deblurring problem in atmospheric image reconstruction
- Effects of Finite-Precision Arithmetic on Interior-Point Methods for Nonlinear Programming
- On the Convergence of the Mizuno--Todd--Ye Algorithm to the Analytic Center of the Solution Set
- Quadratic Convergence in a Primal-Dual Method
- Exact Regularization of Convex Programs
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- On the Implementation of a Primal-Dual Interior Point Method
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- Necessary and sufficient conditions for a penalty method to be exact
- Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
- Ill-Conditioning and Computational Error in Interior Methods for Nonlinear Programming
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- On Effectively Computing the Analytic Center of the Solution Set by Primal-Dual Interior-Point Methods
- Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem
- Convergence and regularity of trust region methods for nonlinear ill-posed inverse problems
- Penalty Methods for a Class of Non-Lipschitz Optimization Problems
This page was built for publication: A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils
