Pages that link to "Item:Q3223815"
From MaRDI portal
The following pages link to Newton-Type Minimization via the Lanczos Method (Q3223815):
Displaying 50 items.
- Efficient tridiagonal preconditioner for the matrix-free truncated Newton method (Q272460) (← links)
- Block truncated-Newton methods for parallel optimization (Q582212) (← links)
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP (Q1024721) (← links)
- Where is the nearest non-regular pencil? (Q1124796) (← links)
- Scaled optimal path trust-region algorithm (Q1306663) (← links)
- On a new stochastic global optimization algorithm based on censored observations (Q1315438) (← links)
- An unconstrained optimization technique for large-scale linearly constrained convex minimization problems (Q1337633) (← links)
- Adaptive algorithms for scalar non-convex variational problems (Q1379037) (← links)
- Truncated Newton methods for optimization with inaccurate functions and gradients (Q1411387) (← links)
- Truncated-Newton training algorithm for neurocomputational viscoplastic model. (Q1418239) (← links)
- A continuation/GMRES method for fast computation of nonlinear receding horizon control (Q1433056) (← links)
- A survey of truncated-Newton methods (Q1593812) (← links)
- A descent hybrid conjugate gradient method based on the memoryless BFGS update (Q1625764) (← links)
- A new preconditioner update strategy for the solution of sequences of linear systems in structural mechanics: application to saddle point problems in elasticity (Q1693306) (← links)
- Nonmonotone curvilinear line search methods for unconstrained optimization (Q1816399) (← links)
- A truncated Newton optimization algorithm in meteorology applications with analytic Hessian/vector products (Q1892597) (← links)
- Optimal assimilation of current and surface elevation data in a two-dimensional numerical tidal model (Q1893708) (← links)
- An extension of the theory of secant preconditioners (Q1900756) (← links)
- Smoothing methods for convex inequalities and linear complementarity problems (Q1924058) (← links)
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization (Q1949261) (← links)
- LAQP: learning-based approximate query processing (Q2055585) (← links)
- Hybrid FEM-NN models: combining artificial neural networks with the finite element method (Q2133536) (← links)
- Sparse noncommutative polynomial optimization (Q2144551) (← links)
- Using error decay prediction to overcome practical issues of deep active learning for named entity recognition (Q2217437) (← links)
- Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization (Q2301133) (← links)
- Solving polynomial least squares problems via semidefinite programming relaxations (Q2655337) (← links)
- Simulation of hot isostatic pressing of metal powder components to near net shape (Q2721424) (← links)
- Limited memory preconditioners for symmetric indefinite problems with application to structural mechanics (Q2955987) (← links)
- Assessing the performance of an optimization-based multilevel method (Q3096878) (← links)
- Newton Methods For Large-Scale Linear Inequality-Constrained Minimization (Q3124041) (← links)
- Re-entry Test Vehicle Configuration Selection and Analysis (Q3133912) (← links)
- Numerical techniques in nonparametric estimation† (Q3776387) (← links)
- Avoiding Modified Matrix Factorizations in Newton-like Methods (Q3802526) (← links)
- Numerical solution of the scalar double-well problem allowing microstructure (Q4340853) (← links)
- An Optimization-Based Domain Decomposition Method for a Two-Body Contact Problem (Q4435191) (← links)
- Least squares estimation of nonhomogeneous poisson processes (Q4519166) (← links)
- Prediction uncertainty and optimal experimental design for learning dynamical systems (Q4591831) (← links)
- A Multigrid Approach to SDP Relaxations of Sparse Polynomial Optimization Problems (Q4600837) (← links)
- Newton-type Alternating Minimization Algorithm for Convex Optimization (Q4629822) (← links)
- A matrix-free line-search algorithm for nonconvex optimization (Q4646671) (← links)
- PARALLEL MULTISPLITTINGS FOR OPTIMIZATION∗ (Q4820118) (← links)
- PARALLEL MULTISPLITTINGS FOR CONSTRAINED OPTIMIZATION (Q4820167) (← links)
- Tensor Product B-Spline Mesh Generation for Accurate Surface Visualizations in the NIST Digital Library of Mathematical Functions (Q5189431) (← links)
- A proximal subgradient projection algorithm for linearly constrained strictly convex problems (Q5436924) (← links)
- A globalization strategy for the multigrid solution of elliptic optimal control problems (Q5475284) (← links)
- Active and passive in-plane wall fluctuations in turbulent channel flows (Q5742340) (← links)
- Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization (Q5853562) (← links)
- On the optimum control of differential-algebraic equations (Q5945076) (← links)
- Deep learning-based parameter estimation of stochastic differential equations driven by fractional Brownian motions with measurement noise (Q6059024) (← links)
- Conformational space annealing explained: a general optimization algorithm, with diverse applications (Q6097845) (← links)
