Second order semi-smooth proximal Newton methods in Hilbert spaces
From MaRDI portal
Publication:2141359
DOI10.1007/s10589-022-00369-9zbMath1493.90149arXiv2103.14344OpenAlexW3147466994MaRDI QIDQ2141359
Patrick Jaap, Bastian Pötzl, Anton Schiela
Publication date: 25 May 2022
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.14344
Nonconvex programming, global optimization (90C26) Newton-type methods (49M15) Numerical methods based on nonlinear programming (49M37) Programming in abstract spaces (90C48)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions
- An inexact successive quadratic approximation method for L-1 regularized optimization
- Practical inexact proximal quasi-Newton method with global complexity analysis
- Fast first-order methods for composite convex optimization with backtracking
- Inexact proximal Newton methods for self-concordant functions
- A mesh-independence result for semismooth Newton methods.
- A coordinate gradient descent method for nonsmooth separable minimization
- On Fréchet subdifferentials
- A flexible coordinate descent method
- Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates
- Globalized inexact proximal Newton-type methods for nonconvex composite functions
- Multi-step fixed-point proximity algorithms for solving a class of optimization problems arising from image processing
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- Fixed point algorithm based on adapted metric method for convex minimization problem with application to image deblurring
- Inexact successive quadratic approximation for regularized optimization
- Proximal Newton-Type Methods for Minimizing Composite Functions
- A Simplified Approach to Semismooth Newton Methods in Function Space
- A generalized proximal point algorithm for certain non-convex minimization problems
- The Primal-Dual Active Set Strategy as a Semismooth Newton Method
- First-Order Methods in Optimization
- A Semismooth Newton Method with Multidimensional Filter Globalization for $l_1$-Optimization
- Truncated nonsmooth Newton multigrid methods for block-separable minimization problems
- Composite Convex Minimization Involving Self-concordant-Like Cost Functions
- Affine conjugate adaptive Newton methods for nonlinear elastomechanics
This page was built for publication: Second order semi-smooth proximal Newton methods in Hilbert spaces