Newton-Type Minimization via the Lanczos Method
From MaRDI portal
Publication:3223815
DOI10.1137/0721052zbMath0558.65041OpenAlexW2065000345MaRDI QIDQ3223815
Publication date: 1984
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0721052
Lanczos methodlarge-scale unconstrained minimizationNumerical resultslinear conjugate-gradient methodnegative-curvature directionpreconditioned truncated Newton method
Related Items (50)
Least squares estimation of nonhomogeneous poisson processes ⋮ Efficient tridiagonal preconditioner for the matrix-free truncated Newton method ⋮ A descent hybrid conjugate gradient method based on the memoryless BFGS update ⋮ An unconstrained optimization technique for large-scale linearly constrained convex minimization problems ⋮ Hybrid FEM-NN models: combining artificial neural networks with the finite element method ⋮ A truncated Newton optimization algorithm in meteorology applications with analytic Hessian/vector products ⋮ Optimal assimilation of current and surface elevation data in a two-dimensional numerical tidal model ⋮ Sparse noncommutative polynomial optimization ⋮ An extension of the theory of secant preconditioners ⋮ PARALLEL MULTISPLITTINGS FOR OPTIMIZATION∗ ⋮ PARALLEL MULTISPLITTINGS FOR CONSTRAINED OPTIMIZATION ⋮ Solving polynomial least squares problems via semidefinite programming relaxations ⋮ Adaptive algorithms for scalar non-convex variational problems ⋮ Where is the nearest non-regular pencil? ⋮ Smoothing methods for convex inequalities and linear complementarity problems ⋮ Deep learning-based parameter estimation of stochastic differential equations driven by fractional Brownian motions with measurement noise ⋮ Prediction uncertainty and optimal experimental design for learning dynamical systems ⋮ Limited memory preconditioners for symmetric indefinite problems with application to structural mechanics ⋮ Conformational space annealing explained: a general optimization algorithm, with diverse applications ⋮ A new preconditioner update strategy for the solution of sequences of linear systems in structural mechanics: application to saddle point problems in elasticity ⋮ Preconditioners for Krylov subspace methods: An overview ⋮ Numerical techniques in nonparametric estimation† ⋮ A Multigrid Approach to SDP Relaxations of Sparse Polynomial Optimization Problems ⋮ Pole-fitting for complex functions: enhancing standard techniques by artificial-neural-network classifiers and regressors ⋮ Truncated Newton methods for optimization with inaccurate functions and gradients ⋮ Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization ⋮ Numerical solution of the scalar double-well problem allowing microstructure ⋮ Truncated-Newton training algorithm for neurocomputational viscoplastic model. ⋮ Using error decay prediction to overcome practical issues of deep active learning for named entity recognition ⋮ Avoiding Modified Matrix Factorizations in Newton-like Methods ⋮ A continuation/GMRES method for fast computation of nonlinear receding horizon control ⋮ Simulation of hot isostatic pressing of metal powder components to near net shape ⋮ A matrix-free line-search algorithm for nonconvex optimization ⋮ Active and passive in-plane wall fluctuations in turbulent channel flows ⋮ On the optimum control of differential-algebraic equations ⋮ A proximal subgradient projection algorithm for linearly constrained strictly convex problems ⋮ Tensor Product B-Spline Mesh Generation for Accurate Surface Visualizations in the NIST Digital Library of Mathematical Functions ⋮ Block truncated-Newton methods for parallel optimization ⋮ An Optimization-Based Domain Decomposition Method for a Two-Body Contact Problem ⋮ Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization ⋮ LAQP: learning-based approximate query processing ⋮ A globalization strategy for the multigrid solution of elliptic optimal control problems ⋮ Nonmonotone curvilinear line search methods for unconstrained optimization ⋮ Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP ⋮ Assessing the performance of an optimization-based multilevel method ⋮ Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization ⋮ Scaled optimal path trust-region algorithm ⋮ A survey of truncated-Newton methods ⋮ Re-entry Test Vehicle Configuration Selection and Analysis ⋮ On a new stochastic global optimization algorithm based on censored observations
Uses Software
This page was built for publication: Newton-Type Minimization via the Lanczos Method
