An inexact regularized proximal Newton method without line search
From MaRDI portal
Publication:6642786
DOI10.1007/s10589-024-00600-9MaRDI QIDQ6642786
Christian Kanzow, Simeon vom Dahl
Publication date: 25 November 2024
Published in: Computational Optimization and Applications (Search for Journal in Brave)
global and local convergencenonsmooth and nonconvex optimizationHölderian local error boundregularized proximal Newton method
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Newton-type methods (49M15) Mathematical programming (90Cxx) Methods of successive quadratic programming type (90C55)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An inexact successive quadratic approximation method for L-1 regularized optimization
- A mathematical introduction to compressive sensing
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization
- A regularized Newton method without line search for unconstrained optimization
- Local behavior of an iterative framework for generalized equations with nonisolated solutions
- A new nonconvex approach to low-rank matrix completion with application to image inpainting
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
- Low-rank approximation. Algorithms, implementation, applications
- Globalized inexact proximal Newton-type methods for nonconvex composite functions
- Convergence properties of monotone and nonmonotone proximal gradient methods revisited
- Inexact successive quadratic approximation for regularized optimization
- Pathwise coordinate optimization
- A globally convergent proximal Newton-type method in nonsmooth convex optimization
- Proximal Newton-Type Methods for Minimizing Composite Functions
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- Linearly Constrained Non-Lipschitz Optimization for Image Restoration
- A generalized proximal point algorithm for certain non-convex minimization problems
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Variational Analysis
- Variational Analysis and Applications
- On $l_q$ Optimization and Matrix Completion
- Dictionary Learning Algorithms and Applications
- A Semismooth Newton Method with Multidimensional Filter Globalization for $l_1$-Optimization
- Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions
- Average curvature FISTA for nonconvex smooth composite optimization problems
- An inexact regularized proximal Newton method for nonconvex and nonsmooth optimization
- Proximal gradient methods beyond monotony
This page was built for publication: An inexact regularized proximal Newton method without line search