Subspace Trust‐Region Methods for Large Bound‐Constrained Nonlinear Equations
From MaRDI portal
Publication:5757402
Recommendations
- Truncated trust region methods based on preconditioned iterative subalgorithms for large sparse systems of nonlinear equations
- A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems
- Subspace methods for large scale nonlinear equations and nonlinear least squares
- An affine scaling trust-region approach to bound-constrained nonlinear systems
- The convergence of subspace trust region methods
Cited in
(35)- Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities
- A fast subspace method for image deblurring
- Truncated trust region methods based on preconditioned iterative subalgorithms for large sparse systems of nonlinear equations
- An inexact Newton-like conditional gradient method for constrained nonlinear systems
- A new class of nonmonotone adaptive trust-region methods for nonlinear equations with box constraints
- Newton's method with feasible inexact projections for solving constrained generalized equations
- A unified local convergence analysis of inexact constrained Levenberg-Marquardt methods
- Quasi-Newton methods for constrained nonlinear systems: complexity analysis and applications
- Constrained dogleg methods for nonlinear systems with simple bounds
- On the convergence of an inexact Gauss-Newton trust-region method for nonlinear least-squares problems with simple bounds
- On the global convergence of an inexact quasi-Newton conditional gradient method for constrained nonlinear systems
- A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization
- A modified conjugate gradient method for monotone nonlinear equations with convex constraints
- The convergence of subspace trust region methods
- A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization
- Globalization strategies for Newton-Krylov methods for stabilized FEM discretization of Navier-Stokes equations
- An inexact projected LM type algorithm for solving convex constrained nonlinear equations
- Inexact Newton methods for model simulation
- On affine-scaling inexact dogleg methods for bound-constrained nonlinear systems
- Globally and superlinearly convergent inexact Newton-Krylov algorithms for solving nonsmooth equations
- A Nested Lanczos Method for the Trust-Region Subproblem
- A Subspace Minimization Method for the Trust-Region Step
- scientific article; zbMATH DE number 1078402 (Why is no real title available?)
- Solving the Trust-Region Subproblem using the Lanczos Method
- A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems
- A Perry-type derivative-free algorithm for solving nonlinear system of equations and minimizing \(\ell_1\) regularized problem
- A trust region method with project step for bound constrained optimization without compact condition
- A Riemannian subspace limited-memory SR1 trust region method
- New updates of incomplete LU factorizations and applications to large nonlinear systems
- Numerical solution of KKT systems in PDE-constrained optimization problems via the affine scaling trust-region approach
- A Regularized Affine-Scaling Trust-Region Method for Parametric Imaging of Dynamic PET Data
- Secant-inexact projection algorithms for solving a new class of constrained mixed generalized equations problems
- An inexact derivative-free Levenberg-Marquardt method for linear inequality constrained nonlinear systems under local error bound conditions
- Broyden quasi-Newton secant-type method for solving constrained mixed generalized equations
- Subspace methods for large scale nonlinear equations and nonlinear least squares
This page was built for publication: Subspace Trust‐Region Methods for Large Bound‐Constrained Nonlinear Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757402)
