The method of steepest descent for non-linear minimization problems
From MaRDI portal
Publication:5840776
DOI10.1090/QAM/10667zbMath0061.26801OpenAlexW2567576169WikidataQ90314523 ScholiaQ90314523MaRDI QIDQ5840776
Publication date: 1944
Published in: Quarterly of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/qam/10667
Related Items (43)
Induction heating processes optimization: A general optimal control approach ⋮ Smooth-curve interpolation: A generalized spline-fit procedure ⋮ On a successive approximation technique in solving some control system optimization problems ⋮ Payoff landscapes and the robustness of selfish optimization in iterated games ⋮ Iterative parameter estimation algorithms for dual-frequency signal models ⋮ Finite-energy pseudoholomorphic planes with multiple asymptotic limits ⋮ Two iterative processes generated by regular vector fields in Banach spaces ⋮ Cooling down stochastic differential equations: Almost sure convergence ⋮ The metric gradient in normed linear spaces ⋮ Global convergence of the gradient method for functions definable in o-minimal structures ⋮ Dimension reduction based adaptive dynamic programming for optimal control of discrete-time nonlinear control-affine systems ⋮ Convex optimization-based structure-preserving filter for multidimensional finite element simulations ⋮ An Efficient and Robust Scalar Auxialiary Variable Based Algorithm for Discrete Gradient Systems Arising from Optimizations ⋮ Multiscale optimal design method of acoustic metamaterials using topology optimization ⋮ Pandemic management by a spatio-temporal mathematical model ⋮ Copulas and Histogram-Valued Data ⋮ Heterogeneous Mediation Analysis on Epigenomic PTSD and Traumatic Stress in a Predominantly African American Cohort ⋮ Iterative inverse kinematics for robot manipulators using quaternion algebra and conformal geometric algebra ⋮ Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods ⋮ Convergence of gradient algorithms for nonconvex \(C^{1+ \alpha}\) cost functions ⋮ On the features of numerical solution of coefficient inverse problems for nonlinear equations of the reaction-diffusion-advection type with data of various types ⋮ Bregman Itoh-Abe methods for sparse optimisation ⋮ On search directions for minimization algorithms ⋮ A gradient descent method for solving a system of nonlinear equations ⋮ Unnamed Item ⋮ Descent methods with computational errors in Banach spaces ⋮ A class of gradient unconstrained minimization algorithms with adaptive stepsize ⋮ An extension of Curry's theorem to steepest descent in normed linear spaces ⋮ New stepsizes for the gradient method ⋮ Backtracking gradient descent method and some applications in large scale optimisation. II: Algorithms and experiments ⋮ Composite Newton-PCG and quasi-Newton iterations for nonlinear consolidation ⋮ Stabilization of solutions of dissipative Hamiltonian systems ⋮ Unnamed Item ⋮ Parameter identification for elliptic problems ⋮ Convexity, monotonicity, and gradient processes in Hilbert space ⋮ Asymptotic behavior of approximate solutions to evolution equations in Banach spaces ⋮ Linearized ridge-path method for function minimization ⋮ Elimination of bounds in optimization problems by transforming variables ⋮ Unnamed Item ⋮ Global convergence of nonlinear cascade flows with Morse-Bott zero dynamics ⋮ Über Dämpfung bei Minimalisierungsverfahren. (On damping in minimization methods) ⋮ Cauchy's method of minimization ⋮ A refined theory for laminated beams. II: An iterative variational approach
This page was built for publication: The method of steepest descent for non-linear minimization problems
