Memoryless quasi-Newton methods based on the spectral-scaling Broyden family for Riemannian optimization (Q6161550): Difference between revisions

Latest revision as of 19:01, 30 December 2024

scientific article; zbMATH DE number 7702985

Language	Label	Description	Also known as
English	Memoryless quasi-Newton methods based on the spectral-scaling Broyden family for Riemannian optimization	scientific article; zbMATH DE number 7702985

Statements

instance of

scholarly article

0 references

title

Memoryless quasi-Newton methods based on the spectral-scaling Broyden family for Riemannian optimization (English)

0 references

0 references

0 references

0 references

0 references

Journal of Optimization Theory and Applications

0 references

publication date

27 June 2023

0 references

zbMATH Keywords

Riemannian optimization

0 references

memoryless quasi-Newton methods

0 references

Broyden family

0 references

global convergence

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Trust-region methods on Riemannian manifolds

0 references

Q5433140

0 references

On measure functions for the self-scaling updating formulae for quasi-newton methods<sup>∗</sup>

0 references

A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization

0 references

An Introduction to Optimization on Smooth Manifolds

0 references

Global rates of convergence for nonconvex optimization on manifolds

0 references

Manopt, a Matlab toolbox for optimization on manifolds

0 references

Spectral-scaling quasi-Newton methods with updates from the one parameter of the Broyden family

0 references

Spectral scaling BFGS method

0 references

Fisher lecture: Dimension reduction in regression

0 references

Likelihood-Based Sufficient Dimension Reduction

0 references

A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search

0 references

Benchmarking optimization software with performance profiles.

0 references

A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search

0 references

Q5479892

0 references

Algorithm 851

0 references

A Broyden Class of Quasi-Newton Methods for Riemannian Optimization

0 references

A Riemannian symmetric rank-one trust-region method

0 references

Riemannian optimization for registration of curves in elastic shape analysis

0 references

A Riemannian BFGS Method Without Differentiated Retraction for Nonconvex Optimization Problems

0 references

Low-rank tensor completion by Riemannian optimization

0 references

Descent three-term conjugate gradient methods based on secant conditions for unconstrained optimization

0 references

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

0 references

Simple algorithms for optimization on Riemannian manifolds with constraints

0 references

A modified BFGS method and its global convergence in nonconvex minimization

0 references

A sufficient descent three-term conjugate gradient method via symmetric rank-one update for large-scale optimization

0 references

Q4627720

0 references

A MEMORYLESS SYMMETRIC RANK-ONE METHOD WITH SUFFICIENT DESCENT PROPERTY FOR UNCONSTRAINED OPTIMIZATION

0 references

Memoryless quasi-Newton methods based on spectral-scaling Broyden family for unconstrained optimization

0 references

Nonlinear conjugate gradient methods with sufficient descent properties for unconstrained optimization

0 references

Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization

0 references

Q5500361

0 references

A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization

0 references

Updating Quasi-Newton Matrices with Limited Storage

0 references

Q5491447

0 references

Sequential Quadratic Optimization for Nonlinear Optimization Problems on Riemannian Manifolds

0 references

Optimization Methods on Riemannian Manifolds and Their Application to Shape Space

0 references

A Dai-Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions

0 references

Riemannian Optimization and Its Applications

0 references

A new, globally convergent Riemannian conjugate gradient method

0 references

Hybrid Riemannian conjugate gradient methods with global convergence properties

0 references

Sufficient descent Riemannian conjugate gradient methods

0 references

Conjugate Gradient Methods with Inexact Searches

0 references

Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization

0 references

Optimization theory and methods. Nonlinear programming

0 references

Pymanopt: A Python Toolbox for Optimization on Manifolds using Automatic Differentiation

0 references

Low-Rank Matrix Completion by Riemannian Optimization

0 references

Sequential optimality conditions for nonlinear optimization on Riemannian manifolds and a globally convergent augmented Lagrangian method

0 references

Quasi-Newton Algorithms with Updates from the Preconvex Part of Broyden's Family

0 references

Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search

0 references

A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence

0 references

Some descent three-term conjugate gradient methods and their global convergence

0 references

Riemannian conjugate gradient methods with inverse retraction

0 references

Identifiers

zbMATH Open document ID

1515.65159

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1007/S10957-023-02183-7

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6161550

@@ Property / DOI @@
-.1007/s10957-023-02183-7
@@ Property / DOI: 10.1007/s10957-023-02183-7 / rank @@
-Normal rank
@@ Property / DOI @@
+.1007/S10957-023-02183-7
@@ Property / DOI: 10.1007/S10957-023-02183-7 / rank @@
+Normal rank