A structured L-BFGS method and its application to inverse problems
From MaRDI portal
Publication:6557640
Recommendations
- Hessian initialization strategies for \(\ell \)-BFGS solving non-linear inverse problems
- A regularized limited memory BFGS method for nonconvex unconstrained minimization
- On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
- A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations
Cites work
- scientific article; zbMATH DE number 7499215 (Why is no real title available?)
- scientific article; zbMATH DE number 3982416 (Why is no real title available?)
- scientific article; zbMATH DE number 3714432 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A Kantorovich theorem for the structured PSB update in Hilbert space.
- A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- A coordinate gradient descent method for nonsmooth separable minimization
- A family of variable metric methods in function space, without exact line searches
- A hybrid semismooth quasi-Newton method for nonsmooth optimal control with PDEs
- A hyperelastic regularization energy for image registration
- A matrix-free approach to parallel and memory-efficient deformable image registration
- A modified BFGS method and its global convergence in nonconvex minimization
- A modified BFGS type quasi-Newton method with line search for symmetric nonlinear equations problems
- A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization
- A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems
- A noise-tolerant quasi-Newton algorithm for unconstrained optimization
- A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations
- A regularized limited memory BFGS method for nonconvex unconstrained minimization
- A unified approach to fast image registration and a new curvature based registration technique.
- Adaptive scaling damped BFGS method without gradient Lipschitz continuity
- An Adaptive Nonlinear Least-Squares Algorithm
- An Infinite-Dimensional Convergence Theory for Reduced SQP Methods in Hilbert Space
- Benchmarking optimization software with performance profiles.
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Compact representations of structured BFGS matrices
- Computational Methods for Inverse Problems
- Convergence Theorems for Least-Change Secant Update Methods
- Convergence of Broyden’s Method in Banach Spaces
- Convergence of Newton-MR under inexact Hessian information
- Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Convergence theory for the structured BFGS secant method with an application to nonlinear least squares
- Discrete inverse problems. Insight and algorithms.
- Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
- FAIR. Flexible algorithms for image registration.
- Fast spherical centroidal Voronoi mesh generation: a Lloyd-preconditioned LBFGS method in parallel
- Faster Independent Component Analysis by Preconditioning With Hessian Approximations
- Global convergence of Gauss-Newton-MBFGS method for solving the nonlinear least squares problem
- Global convergence of a modified limited memory BFGS method for non-convex minimization
- Global convergence of a new hybrid Gauss-Newton structured BFGS method for nonlinear least squares problems
- Hessian initialization strategies for \(\ell \)-BFGS solving non-linear inverse problems
- Hybrid limited memory gradient projection methods for box-constrained optimization problems
- LOCAL AND SUPERLINEAR CONVERGENCE OF STRUCTURED QUASI-NEWTON METHODS FOR NONLINEAR OPTIMIZATION
- Least Change Secant Updates for Quasi-Newton Methods
- Least-Change Sparse Secant Update Methods with Inaccurate Secant Conditions
- Line search algorithms with guaranteed sufficient decrease
- Local and Superlinear Convergence for Partially Known Quasi-Newton Methods
- Newton-MR: inexact Newton method with minimum residual sub-problem solver
- Numerical approximation of partial differential equations
- On efficiently combining limited-memory and trust-region techniques
- On the Derivation of Quasi-Newton Formulas for Optimization in Function Spaces
- On the Use of Product Structure in Secant Methods for Nonlinear Least Squares Problems
- On the convergence and mesh-independent property of the Barzilai-Borwein method for PDE-constrained optimization
- On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
- On the limited memory BFGS method for large scale optimization
- Perspectives on self-scaling variable metric algorithms
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Properties of the block BFGS update and its application to the limited-memory block BNS method for unconstrained minimization
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Quasi-Newton methods for large-scale electromagnetic inverse problems
- Quasi-Newton methods for machine learning: forget the past, just sample
- Quasi-Newton methods: superlinear convergence without line searches for self-concordant functions
- Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization
- Representations of quasi-Newton matrices and their use in limited memory methods
- Solution of Sparse Indefinite Systems of Linear Equations
- Solving nonlinear systems of equations via spectral residual methods: stepsize selection and applications
- Some numerical experiments with variable-storage quasi-Newton algorithms
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- Stabilized Barzilai-Borwein method
- Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization
- Structured two-point stepsize gradient methods for nonlinear least squares
- The global convergence of a modified BFGS method for nonconvex functions
- The projection technique for two open problems of unconstrained optimization problems
- Two-Point Step Size Gradient Methods
- Updating Quasi-Newton Matrices with Limited Storage
Cited in
(1)
This page was built for publication: A structured L-BFGS method and its application to inverse problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6557640)
