Convergence analysis of a proximal newton method1
From MaRDI portal
Publication:4714551
DOI10.1080/01630569608816705zbMath0884.90123OpenAlexW2132068809MaRDI QIDQ4714551
Publication date: 7 November 1996
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630569608816705
Related Items
Fast Moreau envelope computation I: Numerical algorithms ⋮ New conjugacy condition and related new conjugate gradient methods for unconstrained optimization ⋮ Two parallel distribution algorithms for convex constrained minimization problems ⋮ An efficient conjugate gradient method with strong convergence properties for non-smooth optimization ⋮ Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization ⋮ Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions ⋮ A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization ⋮ A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization ⋮ A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs ⋮ Some new step-size rules for optimization problems ⋮ Minimizing and stationary sequences of convex constrained minimization problems ⋮ A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
Cites Work
- Unnamed Item
- Proximity control in bundle methods for convex nondifferentiable minimization
- Convergence of some algorithms for convex minimization
- A proximal-based deomposition method for compositions method for convex minimization problems
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
- An aggregate subgradient method for nonsmooth convex minimization
- Nonsmooth Equations: Motivation and Algorithms
- A Generalization of the Proximal Point Algorithm
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- New Proximal Point Algorithms for Convex Minimization
- Necessary and sufficient conditions for a penalty method to be exact
- Combined Primal–Dual and Penalty Methods for Convex Programming
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Partial Proximal Minimization Algorithms for Convex Pprogramming
- Convergence properties of descent methods for unconstrained minization
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
