Truncated-Newton algorithms for large-scale unconstrained optimization
From MaRDI portal
Publication:3037163
DOI10.1007/BF02592055zbMATH Open0523.90078OpenAlexW1994722534MaRDI QIDQ3037163FDOQ3037163
Publication date: 1983
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02592055
conjugate gradient methodlarge-scale unconstrained optimizationNewton type algorithmmixed-type algorithmsspecial direction search procedure
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Newton-type methods (49M15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]
- Large-scale linearly constrained optimization
- Updating Quasi-Newton Matrices with Limited Storage
- On the Convergence of a New Conjugate Gradient Algorithm
- Methods of conjugate gradients for solving linear systems
- Quasi-Newton Methods, Motivation and Theory
- A discrete Newton algorithm for minimizing a function of many variables
- Inexact Newton Methods
- Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization
- On the Estimation of Sparse Hessian Matrices
- Hyperbolic Pairs in the Method of Conjugate Gradients
- A scaled reduced gradient algorithm for network flow problems with convex separable costs
- A test problem generator for large-scale unconstrained optimization
Cited In (only showing first 100 items - show all)
- Assessing a search direction within a truncated Newton method
- A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization
- Globally convergent inexact generalized Newton's methods for nonsmooth equations
- Convergence analysis of truncated incomplete Hessian Newton minimization method and application in biomolecular potential energy minimization
- Truncated regularized Newton method for convex minimizations
- A two-stage active-set algorithm for bound-constrained optimization
- Local path-following property of inexact interior methods in nonlinear programming
- Efficient tridiagonal preconditioner for the matrix-free truncated Newton method
- Implementing proximal point methods for linear programming
- An interior point method for quadratic programs based on conjugate projected gradients
- A truncated nonmonotone Gauss-Newton method for large-scale nonlinear least-squares problems
- Preconditioning Newton-Krylov methods in nonconvex large scale optimization
- Superlinear convergence theorems for Newton-type methods for nonlinear systems of equations
- Successive linearization methods for large-scale nonlinear programming problems
- Numerical comparisons of nonlinear programming algorithms on serial and vector processors using automatic differentiation
- A successive quadratic programming method for a class of constrained nonsmooth optimization problems
- On large scale nonlinear network optimization
- A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization
- Globally convergent inexact generalized Newton method for first-order differentiable optimization problems
- A choice of forcing terms in inexact Newton method
- Truncated Newton methods for optimization with inaccurate functions and gradients
- Preconditioned Newton methods using incremental unknowns methods for the resolution of a steady-state Navier-Stokes-like problem
- On diagonally structured problems in unconstrained optimization using an inexact super Halley method
- An algorithm for nonlinear optimization problems with binary variables
- An implementation of linear and nonlinear multicommodity network flows
- An automatic regularization parameter selection algorithm in the total variation model for image deblurring
- Block truncated-Newton methods for parallel optimization
- On optimizing a maximin nonlinear function subject to replicated quasi- arborescence-like constraints
- A limited memory BFGS-type method for large-scale unconstrained optimization
- An active set feasible method for large-scale minimization problems with bound constraints
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- A truncated Newton method with non-monotone line search for unconstrained optimization
- A modified truncated Newton algorithm for the logit-based stochastic user equilibrium problem
- An incomplete Hessian Newton minimization method and its application in a chemical database problem
- The trust region subproblem and semidefinite programming*
- A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems
- An unconstrained optimization technique for large-scale linearly constrained convex minimization problems
- Interior point methods for large-scale nonlinear programming
- A nonmonotone inexact Newton method for unconstrained optimization
- Nonmonotone curvilinear line search methods for unconstrained optimization
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application
- A new hybrid classical-quantum algorithm for continuous global optimization problems
- Title not available (Why is that?)
- Truncated partitioning group correction algorithms for large-scale sparse unconstrained optimi\-zation
- Performance evaluation of independent superbasic sets on nonlinear replicated networks
- Truncated Newton method for sparse unconstrained optimization using automatic differentiation
- Tracing post-limit-point paths with incomplete or without factorization of the stiffness matrix
- A class on nonmonotone stabilization methods in unconstrained optimization
- Variable metric methods for unconstrained optimization and nonlinear least squares
- Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization
- A derivative-based algorithm for a particular class of mixed variable optimization problems
- On diagonally preconditioning the truncated Newton method for super-scale linearly constrained nonlinear prrogramming
- A quasi-discrete Newton algorithm with a nonmonotone stabilization technique
- An algorithm for solving sparse nonlinear least squares problems
- An inexact and nonmonotone proximal method for smooth unconstrained minimization
- A More Lenient Stopping Rule for Line Search Algorithms
- Inexact smoothing method for large scale minimax optimization
- Inexact trust region PGC method for large sparse unconstrained optimization
- A discrete Newton algorithm for minimizing a function of many variables
- A choice of forcing terms in inexact Newton iterations with application to pseudo-transient continuation for incompressible fluid flow computations
- Inexact generalized Newton methods for second order \(C\)-differentiable optimization
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
- Title not available (Why is that?)
- Numerical experience with the truncated Newton method for unconstrained optimization
- Weaker Kantorovich type criteria for inexact Newton methods
- Acoustic multi-parameter full waveform inversion based on the wavelet method
- An optimization problem based on a Bayesian approach for the 2D Helmholtz equation
- Coupling brain-tumor biophysical models and diffeomorphic image registration
- Avoiding Modified Matrix Factorizations in Newton-like Methods
- The Conjugate Residual Method in Linesearch and Trust-Region Methods
- Adaptive eigenspace for multi-parameter inverse scattering problems
- The appeals of quadratic majorization-minimization
- A family of quasi-Newton methods for unconstrained optimization problems
- An H-form variant of the partitioned QN method
- A truncated conjugate gradient method with an inexact Gauss-Newton technique for solving nonlinear systems
- Flattened aggregate function method for nonlinear programming with many complicated constraints
- An increasing‐angle property of the conjugate gradient method and the implementation of large‐scale minimization algorithms with line searches
- Truncated-Newton training algorithm for neurocomputational viscoplastic model.
- Title not available (Why is that?)
- PDE-constrained optimization in medical image analysis
- Newton's method for solving parametric linear quadratic control problems
- An Improvement of the Pivoting Strategy in the Bunch and Kaufman Decomposition, Within Truncated Newton Methods
- Newton acceleration on manifolds identified by proximal gradient methods
- Local properties of inexact methods for minimizing nonsmooth composite functions
- Issues on the use of a modified bunch and Kaufman decomposition for large scale Newton's equation
- A truncated Newton optimization algorithm in meteorology applications with analytic Hessian/vector products
- Conjugate gradient (CG)-type method for the solution of Newton's equation within optimization frameworks
- An adaptive truncation criterion, for linesearch-based truncated Newton methods in large scale nonconvex optimization
- Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence
- Improving truncated Newton method for the logit-based stochastic user equilibrium problem
- Constrained $H^1$-Regularization Schemes for Diffeomorphic Image Registration
- Improved convergence order for augmented penalty algorithms
- A sequential quadratic programming-based algorithm for the optimization of gas networks
- A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization
- A low-rank inexact Newton-Krylov method for stochastic eigenvalue problems
- An autoadaptative limited memory Broyden's method to solve systems of nonlinear equations
- An Empirical Interpolation and Model-Variance Reduction Method for Computing Statistical Outputs of Parametrized Stochastic Partial Differential Equations
- Image-Driven Biophysical Tumor Growth Model Calibration
- Riemannian Newton-CG methods for constructing a positive doubly stochastic matrix from spectral data*
- An efficient conjugate direction method with orthogonalization for large-scale quadratic optimization problems
Uses Software
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)
