scientific article
From MaRDI portal
Publication:2743963
zbMath0968.90524MaRDI QIDQ2743963
Publication date: 18 September 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30)
Related Items
An energy error-based method for the resolution of the Cauchy problem in 3D linear elasticity ⋮ Reduced-order models for parameter dependent geometries based on shape sensitivity analysis ⋮ Matrix-free preconditioning using partial matrix estimation ⋮ On sampling from a log-concave density using kinetic Langevin diffusions ⋮ On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians ⋮ On the determination of missing boundary data for solids with nonlinear material behaviors, using displacement fields measured on a part of their boundaries ⋮ Graph models and their efficient implementation for sparse Jacobian matrix determination ⋮ Efficient calculation of Jacobian and adjoint vector products in the wave propagational inverse problem using automatic differentiation ⋮ Convergence of Newton-MR under Inexact Hessian Information ⋮ Sub-sampled Newton methods ⋮ Adjoint code generator ⋮ User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient ⋮ Verified predictions of shape sensitivities in wall-bounded turbulent flows by an adaptive finite-element method ⋮ Higher order Langevin Monte Carlo algorithm ⋮ Computing the sparsity pattern of Hessians using automatic differentiation
Uses Software
