Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions
From MaRDI portal
Publication:2028458
Recommendations
- Globalized inexact proximal Newton-type methods for nonconvex composite functions
- An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions
- Proximal Newton-type methods for minimizing composite functions
- Memoryless quasi-Newton methods based on spectral-scaling Broyden family for unconstrained optimization
- A globally convergent proximal Newton-type method in nonsmooth convex optimization
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Formulation of Variable Metric Methods
- A generalized proximal point algorithm for certain non-convex minimization problems
- A hybrid method of three-term conjugate gradient method and memoryless quasi-Newton method for unconstrained optimization
- A memoryless symmetric rank-one method with sufficient descent property for unconstrained optimization
- A modified BFGS method and its global convergence in nonconvex minimization
- A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization
- A sufficient descent three-term conjugate gradient method via symmetric rank-one update for large-scale optimization
- An interior-point method for large-scale l₁-regularized logistic regression
- Benchmarking optimization software with performance profiles.
- Conjugate Gradient Methods with Inexact Searches
- Continuous Characterizations of the Maximum Clique Problem
- First-order methods in optimization
- Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Inexact proximal Newton methods for self-concordant functions
- Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems
- Massive data discrimination via linear support vector machines
- Memoryless quasi-Newton methods based on spectral-scaling Broyden family for unconstrained optimization
- Model Selection and Estimation in Regression with Grouped Variables
- On measure functions for the self-scaling updating formulae for quasi-newton methods∗
- On quasi-Newton forward-backward splitting: proximal calculus and convergence
- Optimization theory and methods. Nonlinear programming
- Practical inexact proximal quasi-Newton method with global complexity analysis
- Proximal Newton-type methods for minimizing composite functions
- Quasi-Newton Algorithms with Updates from the Preconvex Part of Broyden's Family
- Regression Shrinkage and Selection via The Lasso: A Retrospective
- Sparse Reconstruction by Separable Approximation
- Spectral scaling BFGS method
- Templates for convex cone problems with applications to sparse signal recovery
Cited in
(14)- Globalized inexact proximal Newton-type methods for nonconvex composite functions
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems
- A proximal quasi-Newton method based on memoryless modified symmetric rank-one formula
- Inexact proximal DC Newton-type method for nonconvex composite functions
- Proximal quasi-Newton method for composite optimization over the Stiefel manifold
- An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions
- Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy
- A diagonally scaled Newton-type proximal method for minimization of the models with nonsmooth composite cost functions
- A scalar Hessian estimation with a sparse nonmonotone line search technique for the sparse recovery problem
- Global convergence of a proximal memoryless symmetric rank one method for minimizing composite functions
- An inexact regularized proximal Newton method without line search
- Efficient regularized proximal quasi-Newton methods for large-scale nonconvex composite optimization problems
- Quasi-Newton method with subspace gradients
- A proximal Newton-type algorithm for zeroth-order stochastic composite optimization with a new norm test for sample size selection
This page was built for publication: Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2028458)
