scientific article; zbMATH DE number 88930
From MaRDI portal
Publication:4016506
Recommendations
Cited in
(91)- A modified PRP conjugate gradient method
- A new trust region method with adaptive radius
- Optimality tests for partitioning and sectional search algorithms
- A class of nonmonotone conjugate gradient methods for unconstrained optimization
- Modifying the BFGS method
- How to deal with the unbounded in optimization: Theory and algorithms
- Symbiosis between linear algebra and optimization
- Variable metric methods for unconstrained optimization and nonlinear least squares
- Sequential quadratic programming for large-scale nonlinear optimization
- A descent hybrid conjugate gradient method based on the memoryless BFGS update
- Approximate Hessian for accelerated convergence of aerodynamic shape optimization problems in an adjoint-based framework
- A double-parameter scaling Broyden-Fletcher-Goldfarb-Shanno method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization
- A double parameter scaled BFGS method for unconstrained optimization
- A direct proof and a generalization for a Kantorovich type inequality
- Convergence of line search methods for unconstrained optimization
- Convergence and numerical results for a parallel asynchronous quasi- Newton method
- Using function-values in multi-step quasi-Newton methods
- On conjugate gradient-like methods for eigen-like problems
- Smoothing methods for convex inequalities and linear complementarity problems
- A perfect example for the BFGS method
- A class of gradient unconstrained minimization algorithms with adaptive stepsize
- Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization
- A structured quasi-Newton algorithm with nonmonotone search strategy for structured NLS problems and its application in robotic motion control
- Adaptive scaling damped BFGS method without gradient Lipschitz continuity
- Accelerated memory-less SR1 method with generalized secant equation for unconstrained optimization
- A note on memory-less SR1 and memory-less BFGS methods for large-scale unconstrained optimization
- Diagonal approximation of the Hessian by finite differences for unconstrained optimization
- A double parameter self-scaling memoryless BFGS method for unconstrained optimization
- The projection technique for two open problems of unconstrained optimization problems
- A Hessian-free Newton-Raphson method for the configuration of physics systems featured by numerically asymmetric force field
- A regularized limited memory BFGS method for nonconvex unconstrained minimization
- A method of trust region type for minimizing noisy functions
- A new robust line search technique based on Chebyshev polynomials
- A new version of the Liu-Storey conjugate gradient method
- The convergence of subspace trust region methods
- A preconditioned descent algorithm for variational inequalities of the second kind involving the \(p\)-Laplacian operator
- A diagonal quasi-Newton updating method for unconstrained optimization
- A Bregman extension of quasi-Newton updates. II: Analysis of robustness properties
- Improved sign-based learning algorithm derived by the composite nonlinear Jacobi process
- On step-size estimation of line search methods
- Exploiting Hessian matrix and trust-region algorithm in hyperparameters estimation of Gaussian process
- Conjugate gradient algorithm and fractals
- What, if anything, is new in optimization?
- Convergence Properties of Algorithms for Nonlinear Optimization
- Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems
- scientific article; zbMATH DE number 4178657 (Why is no real title available?)
- Global convergence of conjugate gradient method
- scientific article; zbMATH DE number 3912127 (Why is no real title available?)
- The use of hypothetical points in numerical optimization
- scientific article; zbMATH DE number 4046982 (Why is no real title available?)
- Some numerical methods for the study of the convexity notions arising in the calculus of variations
- Convergence and stability of line search methods for unconstrained optimization
- An algorithm for unconstrained optimization
- Gradient-type methods: a unified perspective in computer science and numerical analysis
- scientific article; zbMATH DE number 733518 (Why is no real title available?)
- scientific article; zbMATH DE number 1069181 (Why is no real title available?)
- scientific article; zbMATH DE number 1094134 (Why is no real title available?)
- A projected gradient and constraint linearization method for nonlinear model predictive control
- The cardiovascular system: mathematical modelling, numerical algorithms and clinical applications
- scientific article; zbMATH DE number 1356716 (Why is no real title available?)
- scientific article; zbMATH DE number 1889337 (Why is no real title available?)
- Optimization in ℝnby Coggin's method
- scientific article; zbMATH DE number 778130 (Why is no real title available?)
- Globally convergent algorithms for solving unconstrained optimization problems
- A noise-tolerant quasi-Newton algorithm for unconstrained optimization
- Convergence of the descent Dai-Yuan conjugate gradient method for unconstrained optimization
- Modified nonmonotone Armijo line search for descent method
- A note on Kantorovich inequality for Hermite matrices
- A functional optimization approach to an inverse magneto-convection problem.
- On the behaviour of a combined extra-updating/self-scaling BFGS method
- Low cost optimization techniques for solving the nonlinear seismic reflection tomography problem
- Modified globally convergent Polak-Ribière-Polyak conjugate gradient methods with self-correcting property for large-scale unconstrained optimization
- An overview of nonlinear optimization
- Nonmonotone adaptive trust region method
- New quasi-Newton methods via higher order tensor models
- A symmetric rank-one method based on extra updating techniques for unconstrained optimization
- A proximal stochastic quasi-Newton algorithm with dynamical sampling and stochastic line search
- A new class of nonmonotone conjugate gradient training algorithms
- An adaptive scaled BFGS method for unconstrained optimization
- An efficient Dai-Kou-type method with image de-blurring application
- A review of benchmark and test functions for global optimization algorithms and metaheuristics
- Optimizing the optimizer for physics-informed neural networks and Kolmogorov-Arnold networks
- Optimiza: a computational package for the optimization of nonlinear problems
- Combining physics-based and data-driven models: advancing the frontiers of research with scientific machine learning
- A new scaled BFGS method for convex constraints monotone systems: applications in motion control
- Some three-term RMIL conjugate gradient methods with descent property for solving optimization problems with application
- Differential optimization techniques
- New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
- Convergence of the Polak-Ribiére-Polyak conjugate gradient method
- A new conjugate gradient algorithm for training neural networks based on a modified secant equation
- Convergence of PRP method with new nonmonotone line search
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4016506)
