A structured L-BFGS method and its application to inverse problems (Q6557640)

scientific article; zbMATH DE number 7867302

Language	Label	Description	Also known as
English	A structured L-BFGS method and its application to inverse problems	scientific article; zbMATH DE number 7867302

Statements

instance of

scholarly article

0 references

title

A structured L-BFGS method and its application to inverse problems (English)

0 references

0 references

0 references

0 references

0 references

18 June 2024

0 references

zbMATH Keywords

structured L-BFGS

0 references

non-convex optimization

0 references

Kurdyka-Łojasiewicz condition

0 references

seed matrix

0 references

medical imaging

0 references

image registration

0 references

inverse problems

0 references

MaRDI profile type

Publication

0 references

cites work

Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality

0 references

Faster Independent Component Analysis by Preconditioning With Hessian Approximations

0 references

On the convergence and mesh-independent property of the Barzilai–Borwein method for PDE-constrained optimization

0 references

Hessian initialization strategies for \(\ell \)-BFGS solving non-linear inverse problems

0 references

Convergence of the Iterates of Descent Methods for Analytic Cost Functions

0 references

Numerical Approximation of Partial Differential Equations

0 references

Two-Point Step Size Gradient Methods

0 references

A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems

0 references

Stabilized Barzilai-Borwein Method

0 references

Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs

0 references

Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity

0 references

Compact representations of structured BFGS matrices

0 references

On efficiently combining limited-memory and trust-region techniques

0 references

Quasi-Newton methods for machine learning: forget the past, just sample

0 references

A Hyperelastic Regularization Energy for Image Registration

0 references

A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization

0 references

Representations of quasi-Newton matrices and their use in limited memory methods

0 references

Hybrid limited memory gradient projection methods for box-constrained optimization problems

0 references

Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming

0 references

An Adaptive Nonlinear Least-Squares Algorithm

0 references

Benchmarking optimization software with performance profiles.

0 references

Convergence theory for the structured BFGS secant method with an application to nonlinear least squares

0 references

Least Change Secant Updates for Quasi-Newton Methods

0 references

Convergence Theorems for Least-Change Secant Update Methods

0 references

Least-Change Sparse Secant Update Methods with Inaccurate Secant Conditions

0 references

Local and Superlinear Convergence for Partially Known Quasi-Newton Methods

0 references

Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates

0 references

A unified approach to fast image registration and a new curvature based registration technique.

0 references

Quasi-Newton methods: superlinear convergence without line searches for self-concordant functions

0 references

Some numerical experiments with variable-storage quasi-Newton algorithms

0 references

Q3746803

0 references

Q3906009

0 references

Quasi-Newton methods for large-scale electromagnetic inverse problems

0 references

Discrete Inverse Problems

0 references

Convergence of Broyden’s Method in Banach Spaces

0 references

On the Use of Product Structure in Secant Methods for Nonlinear Least Squares Problems

0 references

A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization

0 references

A Matrix-Free Approach to Parallel and Memory-Efficient Deformable Image Registration

0 references

Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization

0 references

An Infinite-Dimensional Convergence Theory for Reduced SQP Methods in Hilbert Space

0 references

A Kantorovich theorem for the structured PSB update in Hilbert space.

0 references

A modified BFGS method and its global convergence in nonconvex minimization

0 references

On the global convergence of the BFGS method for nonconvex unconstrained optimization problems

0 references

A regularized limited memory BFGS method for nonconvex unconstrained minimization

0 references

Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality

0 references

On the limited memory BFGS method for large scale optimization

0 references

Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods

0 references

Convergence of Newton-MR under Inexact Hessian Information

0 references

Solving nonlinear systems of equations via spectral residual methods: stepsize selection and applications

0 references

FAIR

0 references

A family of variable metric methods in function space, without exact line searches

0 references

A hybrid semismooth quasi-Newton method for nonsmooth optimal control with PDEs

0 references

Q3391380

0 references

Line search algorithms with guaranteed sufficient decrease

0 references

Structured two-point stepsize gradient methods for nonlinear least squares

0 references

Updating Quasi-Newton Matrices with Limited Storage

0 references

Q5491447

0 references

Perspectives on self-scaling variable metric algorithms

0 references

Solution of Sparse Indefinite Systems of Linear Equations

0 references

Newton-MR: inexact Newton method with minimum residual sub-problem solver

0 references

A Noise-Tolerant Quasi-Newton Algorithm for Unconstrained Optimization

0 references

A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems

0 references

A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations

0 references

A coordinate gradient descent method for nonsmooth separable minimization

0 references

Properties of the block BFGS update and its application to the limited-memory block BNS method for unconstrained minimization

0 references

Computational Methods for Inverse Problems

0 references

On the Derivation of Quasi-Newton Formulas for Optimization in Function Spaces

0 references

Global convergence of Gauss-Newton-MBFGS method for solving the nonlinear least squares problem

0 references

Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization

0 references

Global convergence of a modified limited memory BFGS method for non-convex minimization

0 references

Fast spherical centroidal Voronoi mesh generation: a Lloyd-preconditioned LBFGS method in parallel

0 references

The global convergence of a modified BFGS method for nonconvex functions

0 references

The projection technique for two open problems of unconstrained optimization problems

0 references

LOCAL AND SUPERLINEAR CONVERGENCE OF STRUCTURED QUASI-NEWTON METHODS FOR NONLINEAR OPTIMIZATION

0 references

Adaptive scaling damped BFGS method without gradient Lipschitz continuity

0 references

Global Convergence of a New Hybrid Gauss–Newton Structured BFGS Method for Nonlinear Least Squares Problems

0 references

A modified BFGS type quasi-Newton method with line search for symmetric nonlinear equations problems

0 references

Identifiers

zbMATH Open document ID

1548.90401

0 references

Mathematics Subject Classification ID

0 references

0 references

10.1088/1361-6420/AD2C31

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6557640