Variable metric methods of minimisation

Cited in

(60)

Finding a positive semidefinite interval for a parametric matrix
Distributed-parameter optimal control via mathematical programming
Quasi-Newton-Verfahren vom Rang-Eins-Typ zur Lösung unrestringierter Minimierungsprobleme. I: Verfahren und grundlegende Eigenschaften
Quasi-Newton-Verfahren vom Rang-Eins-Typ zur Lösung unrestringierter Minimierungsprobleme. II: n-Schritt-quadratische Konvergenz für Restart-Varianten
The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
Supermemory descent methods for unconstrained minimization
Numerical experiments on DFP-method, a powerful function minimization technique
Multi-search optimization techniques
On some classes of variationally derived quasi-Newton methods for systems of nonlinear algebraic equations
On the relation between quadratic termination and convergence properties of minimization algorithms. Part I. Theory
On the relation between quadratic termination and convergence properties of minimization algorithms. Part II. Applications
Time evolutional analysis of nonlinear structures
A unified derivation of quasi-Newton methods for solving non-sparse and sparse nonlinear equations
Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization
The convergence of Broyden algorithms for LC gradient function
Global convergence property of scaled two-step BFGS method
A survey of model reference adaptive techniques - theory and applications
Global convergence of the Broyden's class of quasi-Newton methods with nonmonotone linesearch
Global convergence properties of the modified BFGS method associating with general line search model
A parallel quasi-Newton algorithm for unconstrained optimization
Mechanical system modelling using recurrent neural networks via quasi- Newton learning methods
A new modified BFGS method for unconstrained optimization problems
Using nonlinear functions to approximate a new quasi-Newton method for unconstrained optimization problems
A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations
Limited-memory BFGS with displacement aggregation
Global convergence of a modified Broyden family method for nonconvex functions
Global convergence of a modified BFGS-type method for unconstrained non-convex minimization
On variable-metric algorithms
On the use of generalized inverses in function minimization
Projection method for unconstrained optimization
A diverse strategy method of minimization
Unconstrained approach to the extremization of constrained functions
A nonmonotone Broyden method for unconstrained optimization
Maximum entropy derivation of quasi-Newton methods
On the influence of fluid-structure-interaction on the stability of thin-walled shell structures
On the performance of a new symmetric rank-one method with restart for solving unconstrained optimization problems
Some notes on the quasi-Newton methods
Sensitivity analysis for optimal and feedback controls applied to growth models
Superlinearly convergent variable metric algorithms for general nonlinear programming problems
An improved quasi-newton method for unconstrained optimization
Global convergece of the bfgs algorithm with nonmonotone linesearch^∗^∗this work is supported by national natural science foundation$ef:
Partitioned simulation of fluid-structure interaction. Coupling black-box solvers with quasi-Newton techniques
Convergence analysis of the Levenberg–Marquardt method
Variable metric forward-backward splitting with applications to monotone inclusions in duality
The Convergence of Single-Rank Quasi-Newton Methods
Recent advances in unconstrained optimization
An efficient algorithm for minimizing barrier and penalty functions
An algorithm for solving linearly constrained optimization problems
An efficient one—dimensional search procedure for barrier functions
Relative efficiency of computing optimal growth by conjugate gradient and Davidon methods
Convergence analysis of the self-dual optimally conditioned ssvm method of oren-spedicato
A Variable Metric Forward-Reflected-Douglas-Rachford Method for Solving Monotone Inclusions
Analysis of a self-scaling quasi-Newton method
Quasi-Newton Acceleration of EM and MM Algorithms via Broyden’s Method
Analysis of a new BFGS algorithm and conjugate gradient algorithms and their applications in image restoration and machine learning
Convergence analysis of a modified BFGS method on convex minimizations
A modified Broyden family algorithm with global convergence under a weak Wolfe-Powell line search for unconstrained nonconvex problems
Global convergence properties of two modified BFGS-type methods
On the limited memory BFGS method for large scale optimization
A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule

This page was built for publication: Variable metric methods of minimisation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5607584)