scientific article; zbMATH DE number 778130
From MaRDI portal
Publication:4840579
conjugate gradient methodslarge unstructured systemspartially separable optimizationunconstrained optimization
Numerical mathematical programming methods (65K05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Nonlinear programming (90C30)
Recommendations
- On the limited memory BFGS method for large scale optimization
- scientific article; zbMATH DE number 88930
- Limited-Memory Reduced-Hessian Methods for Large-Scale Unconstrained Optimization
- A Numerical Study of the Limited Memory BFGS Method and the Truncated-Newton Method for Large Scale Optimization
- scientific article; zbMATH DE number 4199988
Cited in
(37)- Gaussian kernel optimization for pattern classification
- On the use of function-values in unconstrained optimisation
- How to deal with the unbounded in optimization: Theory and algorithms
- Simulation of hot isostatic pressing of a powder metal component with an internal core
- 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
- Entropy densities with an application to autoregressive conditional skewness and kurtosis.
- A perfect example for the BFGS method
- A new hybrid PRPFR conjugate gradient method for solving nonlinear monotone equations and image restoration problems
- Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function
- Adaptive scaling damped BFGS method without gradient Lipschitz continuity
- The projection technique for two open problems of unconstrained optimization problems
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- A modified secant equation quasi-Newton method for unconstrained optimization
- Scaling limits in computational Bayesian inversion
- scientific article; zbMATH DE number 3912127 (Why is no real title available?)
- scientific article; zbMATH DE number 44981 (Why is no real title available?)
- scientific article; zbMATH DE number 88930 (Why is no real title available?)
- Inexact trust region PGC method for large sparse unconstrained optimization
- Tests for serial correlation and overdispersion in a count data regression model∗
- scientific article; zbMATH DE number 1889337 (Why is no real title available?)
- A conjugate gradient method based on a modified secant relation for unconstrained optimization
- A spectral KRMI conjugate gradient method under the strong-Wolfe line search
- A modified three-term PRP conjugate gradient algorithm for optimization models
- A modified BFGS method and its global convergence in nonconvex minimization
- On the behaviour of a combined extra-updating/self-scaling BFGS method
- A derivative-free scaling memoryless DFP method for solving large scale nonlinear monotone equations
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Global convergence via modified self-adaptive approach for solving constrained monotone nonlinear equations with application to signal recovery problems
- An adaptive projection BFGS method for nonconvex unconstrained optimization problems
- A symmetric rank-one method based on extra updating techniques for unconstrained optimization
- An accelerated relaxed-inertial strategy based CGP algorithm with restart technique for constrained nonlinear pseudo-monotone equations to image de-blurring problems
- An adaptive scaled BFGS method for unconstrained optimization
- Optimizing the optimizer for physics-informed neural networks and Kolmogorov-Arnold networks
- A new spectral conjugate gradient method for convex constrained monotone nonlinear equations with application to image restoration
- A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule
- A coordinate gradient descent method for nonsmooth separable minimization
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 Q4840579)
