A globally convergent proximal Newton-type method in nonsmooth convex optimization
From MaRDI portal
Publication:2687066
Recommendations
- Globalized inexact proximal Newton-type methods for nonconvex composite functions
- A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
- A modified proximal gradient method for a family of nonsmooth convex optimization problems
- Globally convergent BFGS method for nonsmooth convex optimization
- On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems
Cites work
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A generalized proximal point algorithm for certain non-convex minimization problems
- An easy path to convex analysis and applications
- An improved GLMNET for L1-regularized logistic regression
- An inexact successive quadratic approximation method for L-1 regularized optimization
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Characterization of metric regularity of subdifferentials
- Convergence Properties of the Inexact Levenberg-Marquardt Method under Local Error Bound Conditions
- Error bounds, quadratic growth, and linear convergence of proximal methods
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- First-order methods in optimization
- Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- Higher-order metric subregularity and its applications
- Hölder metric subregularity with applications to proximal point method
- Hölder weak sharp minimizers and Hölder tilt-stability
- Implicit Functions and Solution Mappings
- Inexact successive quadratic approximation for regularized optimization
- Lectures on convex optimization
- Linear convergence of first order methods for non-strongly convex optimization
- Local behavior of an iterative framework for generalized equations with nonisolated solutions
- Metric subregularity of order \(q\) and the solving of inclusions
- Metric subregularity of the convex subdifferential in Banach spaces
- Monotone Operators and the Proximal Point Algorithm
- Newton-Type Methods for Optimization and Variational Problems
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- Pathwise coordinate optimization
- Practical inexact proximal quasi-Newton method with global complexity analysis
- Proximal Newton-type methods for minimizing composite functions
- Proximal quasi-Newton methods for nondifferentiable convex optimization
- Second-order growth, tilt stability, and metric regularity of the subdifferential
- Variational Analysis
- Variational analysis and applications
- Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems
Cited in
(36)- Globally convergent Jacobian smoothing inexact Newton methods for NCP
- A preconditioning proximal Newton method for nondifferentiable convex optimization
- A globally convergent Newton method for convex \(SC^ 1\) minimization problems
- Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions
- Globalized inexact proximal Newton-type methods for nonconvex composite functions
- Second order semi-smooth proximal Newton methods in Hilbert spaces
- Global convergence of model function based Bregman proximal minimization algorithms
- On the proximal Landweber Newton method for a class of nonsmooth convex problems
- A globally convergent LP-Newton method
- A new homotopy proximal variable-metric framework for composite convex minimization
- COAP 2021 best paper prize
- Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials
- A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems
- A Generalized Newton Method for Subgradient Systems
- Globally convergent coderivative-based generalized Newton methods in nonsmooth optimization
- Proximal quasi-Newton method for composite optimization over the Stiefel manifold
- Minimizing oracle-structured composite functions
- Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity
- Inexact proximal Newton methods in Hilbert spaces
- A Riemannian Proximal Newton Method
- A Globally Convergent Proximal Newton-Type Method in Nonsmooth Convex Optimization
- An inexact regularized proximal Newton method for nonconvex and nonsmooth optimization
- Generalized Newton Method with Positive Definite Regularization for Nonsmooth Optimization Problems with Nonisolated Solutions
- A VMiPG method for composite optimization with nonsmooth term having no closed-form proximal mapping
- An inexact regularized proximal Newton method without line search
- An inexact regularized proximal Newton-type method for nonconvex composite optimization problems
- Local convergence of modified Potra-Pták like method in Banach spaces
- An inexact variable metric variant of incremental aggregated Forward-Backward method for the large-scale composite optimization problem
- An inexact q-order regularized proximal Newton method for nonconvex composite optimization
- On a globally convergent semismooth^* Newton method in nonsmooth nonconvex optimization
- An inexact proximal Newton method for nonconvex composite minimization
- An inexact projected regularized Newton method for fused zero-norms regularization problems
- A linesearch-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization
- A superlinear convergence framework for Kurdyka-Łojasiewicz optimization
- Composite optimization with indicator functions: stationary duality and a semismooth Newton method
- A globally convergent descent method for nonsmooth variational inequalities
This page was built for publication: A globally convergent proximal Newton-type method in nonsmooth convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2687066)
