Truncated-Newton algorithms for large-scale unconstrained optimization
From MaRDI portal
Cites work
- A discrete Newton algorithm for minimizing a function of many variables
- A scaled reduced gradient algorithm for network flow problems with convex separable costs
- A test problem generator for large-scale unconstrained optimization
- Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]
- scientific article; zbMATH DE number 3686229 (Why is no real title available?)
- scientific article; zbMATH DE number 3687182 (Why is no real title available?)
- scientific article; zbMATH DE number 3511513 (Why is no real title available?)
- scientific article; zbMATH DE number 3551785 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- scientific article; zbMATH DE number 3430031 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Hyperbolic Pairs in the Method of Conjugate Gradients
- Inexact Newton Methods
- Large-scale linearly constrained optimization
- Methods of conjugate gradients for solving linear systems
- On the Convergence of a New Conjugate Gradient Algorithm
- On the Estimation of Sparse Hessian Matrices
- Quasi-Newton Methods, Motivation and Theory
- Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization
- Updating Quasi-Newton Matrices with Limited Storage
Cited in
(only showing first 100 items - show all)- A limited memory BFGS-type method for large-scale unconstrained optimization
- Performance evaluation of independent superbasic sets on nonlinear replicated networks
- Numerical experience with the truncated Newton method for unconstrained optimization
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Truncated Newton method for sparse unconstrained optimization using automatic differentiation
- Numerical comparisons of nonlinear programming algorithms on serial and vector processors using automatic differentiation
- Implementing proximal point methods for linear programming
- Preconditioned Newton methods using incremental unknowns methods for the resolution of a steady-state Navier-Stokes-like problem
- A successive quadratic programming method for a class of constrained nonsmooth optimization problems
- Successive linearization methods for large-scale nonlinear programming problems
- Tracing post-limit-point paths with incomplete or without factorization of the stiffness matrix
- An interior point method for quadratic programs based on conjugate projected gradients
- An implementation of linear and nonlinear multicommodity network flows
- Inexact generalized Newton methods for second order C-differentiable optimization
- A sequential quadratic programming-based algorithm for the optimization of gas networks
- Superlinear convergence theorems for Newton-type methods for nonlinear systems of equations
- An unconstrained optimization technique for large-scale linearly constrained convex minimization problems
- Perturbed steepest-descent technique in multiextremal problems
- Truncated Newton methods for optimization with inaccurate functions and gradients
- Truncated-Newton training algorithm for neurocomputational viscoplastic model.
- Variable metric methods for unconstrained optimization and nonlinear least squares
- Nonmonotone curvilinear line search methods for unconstrained optimization
- An algorithm for solving sparse nonlinear least squares problems
- A quasi-discrete Newton algorithm with a nonmonotone stabilization technique
- An H-form variant of the partitioned QN method
- A truncated Newton optimization algorithm in meteorology applications with analytic Hessian/vector products
- An active set feasible method for large-scale minimization problems with bound constraints
- Coupling brain-tumor biophysical models and diffeomorphic image registration
- Issues on the use of a modified bunch and Kaufman decomposition for large scale Newton's equation
- PDE-constrained optimization in medical image analysis
- Inexact Newton method with feasible inexact projections for solving constrained smooth and nonsmooth equations
- Adaptive eigenspace for multi-parameter inverse scattering problems
- An optimization problem based on a Bayesian approach for the 2D Helmholtz equation
- Flattened aggregate function method for nonlinear programming with many complicated constraints
- An inexact and nonmonotone proximal method for smooth unconstrained minimization
- A class on nonmonotone stabilization methods in unconstrained optimization
- A modified truncated Newton algorithm for the logit-based stochastic user equilibrium problem
- A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization
- Improving truncated Newton method for the logit-based stochastic user equilibrium problem
- A low-rank inexact Newton-Krylov method for stochastic eigenvalue problems
- A nonmonotone inexact Newton method for unconstrained optimization
- A two-stage active-set algorithm for bound-constrained optimization
- An autoadaptative limited memory Broyden's method to solve systems of nonlinear equations
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
- Truncated partitioning group correction algorithms for large-scale sparse unconstrained optimi\-zation
- A trust region method for solving the decentralized static output feedback design problem
- An adaptive truncation criterion, for linesearch-based truncated Newton methods in large scale nonconvex optimization
- A truncated conjugate gradient method with an inexact Gauss-Newton technique for solving nonlinear systems
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application
- Improved convergence order for augmented penalty algorithms
- An incomplete Hessian Newton minimization method and its application in a chemical database problem
- Efficient tridiagonal preconditioner for the matrix-free truncated Newton method
- A class of modified BFGS methods with function value information for unconstrained optimization
- Adaptive eigenspace method for inverse scattering problems in the frequency domain
- Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence
- Constrained H^1-regularization schemes for diffeomorphic image registration
- On optimizing a maximin nonlinear function subject to replicated quasi- arborescence-like constraints
- Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization
- Local properties of inexact methods for minimizing nonsmooth composite functions
- Numerical techniques in nonparametric estimation†
- Preconditioning Newton-Krylov methods in nonconvex large scale optimization
- Newton's method for solving parametric linear quadratic control problems
- Avoiding Modified Matrix Factorizations in Newton-like Methods
- Computational experience with globally convergent descent methods for large sparse systems of nonlinear equations∗
- Weaker Kantorovich type criteria for inexact Newton methods
- A discrete Newton algorithm for minimizing a function of many variables
- A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization
- scientific article; zbMATH DE number 13594 (Why is no real title available?)
- scientific article; zbMATH DE number 179183 (Why is no real title available?)
- Inexact smoothing method for large scale minimax optimization
- Inexact trust region PGC method for large sparse unconstrained optimization
- On diagonally structured problems in unconstrained optimization using an inexact super Halley method
- Implicitly restarted projection algorithm for solving optimization problems
- A family of quasi-Newton methods for unconstrained optimization problems
- Conjugate gradient (CG)-type method for the solution of Newton's equation within optimization frameworks
- A derivative-based algorithm for a particular class of mixed variable optimization problems
- The trust region subproblem and semidefinite programming*
- A More Lenient Stopping Rule for Line Search Algorithms
- A new hybrid classical-quantum algorithm for continuous global optimization problems
- scientific article; zbMATH DE number 1444279 (Why is no real title available?)
- Estimation method for inverse problems with linear forward operator and its application to magnetization estimation from magnetic force microscopy images using deep learning
- A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results
- Image-Driven Biophysical Tumor Growth Model Calibration
- Riemannian Newton-CG methods for constructing a positive doubly stochastic matrix from spectral data
- Acoustic multi-parameter full waveform inversion based on the wavelet method
- The Conjugate Residual Method in Linesearch and Trust-Region Methods
- An Inexact Newton--Krylov Algorithm for Constrained Diffeomorphic Image Registration
- An increasing‐angle property of the conjugate gradient method and the implementation of large‐scale minimization algorithms with line searches
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- Convergence analysis of truncated incomplete Hessian Newton minimization method and application in biomolecular potential energy minimization
- Interior point methods for large-scale nonlinear programming
- An empirical interpolation and model-variance reduction method for computing statistical outputs of parametrized stochastic partial differential equations
- An efficient conjugate direction method with orthogonalization for large-scale quadratic optimization problems
- Block truncated-Newton methods for parallel optimization
- Globally convergent inexact generalized Newton method for first-order differentiable optimization problems
- Globally convergent inexact generalized Newton's methods for nonsmooth equations
- Newton acceleration on manifolds identified by proximal gradient methods
- An Improvement of the Pivoting Strategy in the Bunch and Kaufman Decomposition, Within Truncated Newton Methods
- A matrix-free exact Newton method
- The appeals of quadratic majorization-minimization
This page was built for publication: Truncated-Newton algorithms for large-scale unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3037163)
