Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions
type: Item
instance of: scholarly article
title: Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions
zbMATH Open document ID: 1469.90141
author: Shummin Nakayama
author: Yasushi Narushima
author: Hiroshi Yabe
published in: Computational Optimization and Applications
publication date: 2021-06-01T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C53
zbMATH DE Number: 7353216
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: proximal Newton-type method
zbMATH Keywords: inexact proximal method
zbMATH Keywords: memoryless quasi-Newton method
zbMATH Keywords: Broyden family
zbMATH Keywords: global and local convergence properties
describes a project that uses: SparseLOGREG
describes a project that uses: TFOCS
describes a project that uses: PNOPT
describes a project that uses: LIBSVM
MaRDI profile type: Publication
full work available at URL: s10589-021-00264-9
OpenAlex ID: W3126432705
cites work: On measure functions for the self-scaling updating formulae for quasi-newton methods∗
cites work: First-Order Methods in Optimization
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Templates for convex cone problems with applications to sparse signal recovery
cites work: On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence
cites work: Massive data discrimination via linear support vector machines
cites work: Spectral scaling BFGS method
cites work: Benchmarking optimization software with performance profiles.
cites work: A generalized proximal point algorithm for certain non-convex minimization problems
cites work: Continuous Characterizations of the Maximum Clique Problem
cites work: A Formulation of Variable Metric Methods
cites work: Q3174129
cites work: A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization
cites work: Proximal Newton-Type Methods for Minimizing Composite Functions
cites work: Inexact proximal Newton methods for self-concordant functions
cites work: A modified BFGS method and its global convergence in nonconvex minimization
cites work: A sufficient descent three-term conjugate gradient method via symmetric rank-one update for large-scale optimization
cites work: Q4627720
cites work: A MEMORYLESS SYMMETRIC RANK-ONE METHOD WITH SUFFICIENT DESCENT PROPERTY FOR UNCONSTRAINED OPTIMIZATION
cites work: Memoryless quasi-Newton methods based on spectral-scaling Broyden family for unconstrained optimization
cites work: Practical inexact proximal quasi-Newton method with global complexity analysis
cites work: Conjugate Gradient Methods with Inexact Searches
cites work: Forward-backward quasi-Newton methods for nonsmooth optimization problems
cites work: Optimization theory and methods. Nonlinear programming
cites work: Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms
cites work: Q4864293
cites work: Regression Shrinkage and Selection via The Lasso: A Retrospective
cites work: Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems
cites work: Sparse Reconstruction by Separable Approximation
cites work: Model Selection and Estimation in Regression with Grouped Variables
cites work: Quasi-Newton Algorithms with Updates from the Preconvex Part of Broyden's Family
DOI: 10.1007/S10589-021-00264-9
description: scientific article; zbMATH DE number 7353216