Globalized inexact proximal Newton-type methods for nonconvex composite functions
From MaRDI portal
Publication:2028488
Recommendations
- Proximal Newton-type methods for minimizing composite functions
- A globally convergent proximal Newton-type method in nonsmooth convex optimization
- Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions
- A proximal method for composite minimization
- Gradient methods for minimizing composite functions
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A coordinate gradient descent method for nonsmooth separable minimization
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
- A flexible coordinate descent method
- A generalized proximal point algorithm for certain non-convex minimization problems
- A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
- A semismooth Newton method with multidimensional filter globalization for \(l_1\)-optimization
- A semismooth equation approach to the solution of nonlinear complementarity problems
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- An inexact successive quadratic approximation method for L-1 regularized optimization
- An interior-point method for large-scale \(l_1\)-regularized logistic regression
- Benchmarking optimization software with performance profiles.
- Computing a Trust Region Step
- Convex analysis and monotone operator theory in Hilbert spaces
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Fast first-order methods for composite convex optimization with backtracking
- First-order methods in optimization
- Fixed point algorithm based on adapted metric method for convex minimization problem with application to image deblurring
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- Gradient methods for minimizing composite functions
- Inexact proximal Newton methods for self-concordant functions
- Inexact successive quadratic approximation for regularized optimization
- Model Selection and Estimation in Regression with Grouped Variables
- Monotone Operators and the Proximal Point Algorithm
- Multi-step fixed-point proximity algorithms for solving a class of optimization problems arising from image processing
- New convergence results for the scaled gradient projection method
- On quasi-Newton forward-backward splitting: proximal calculus and convergence
- On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
- Practical inexact proximal quasi-Newton method with global complexity analysis
- Proximal Newton-type methods for minimizing composite functions
- Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates
- Proximité et dualité dans un espace hilbertien
- Representations of quasi-Newton matrices and their use in limited memory methods
- Robust inversion, dimensionality reduction, and randomized sampling
- Signal Recovery by Proximal Forward-Backward Splitting
- Sparse Reconstruction by Separable Approximation
- The Group Lasso for Logistic Regression
- Variable metric inexact line-search-based methods for nonsmooth optimization
Cited in
(26)- A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems
- Second order semi-smooth proximal Newton methods in Hilbert spaces
- A globally convergent proximal Newton-type method in nonsmooth convex optimization
- COAP 2021 best paper prize
- A proximal stochastic quasi-Newton algorithm with dynamical sampling and stochastic line search
- A proximal method for composite minimization
- Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions
- Local convergence analysis of an inexact trust-region method for nonsmooth optimization
- Composite convex optimization with global and local inexact oracles
- A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems
- Generalized self-concordant functions: a recipe for Newton-type methods
- One-Step Estimation with Scaled Proximal Methods
- An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions
- Inexact proximal Newton methods in Hilbert spaces
- Proximal gradient methods beyond monotony
- Global convergence of a proximal memoryless symmetric rank one method for minimizing composite functions
- An inexact regularized proximal Newton method without line search
- Globally convergent coderivative-based generalized Newton methods in nonsmooth optimization
- Inexact proximal DC Newton-type method for nonconvex composite functions
- LASSO Reloaded: A Variational Analysis Perspective with Applications to Compressed Sensing
- Proximal Newton-type methods for minimizing composite functions
- A VMiPG method for composite optimization with nonsmooth term having no closed-form proximal mapping
- Practical inexact proximal quasi-Newton method with global complexity analysis
- An inexact regularized proximal Newton-type method for nonconvex composite optimization problems
- Efficient regularized proximal quasi-Newton methods for large-scale nonconvex composite optimization problems
This page was built for publication: Globalized inexact proximal Newton-type methods for nonconvex composite functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2028488)
