Pages that link to "Item:Q4714551"

The following pages link to Convergence analysis of a proximal newton method¹ (Q4714551):

Displaying 17 items.

• A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations (Q255074) (← links)
• Local convergence analysis of proximal Gauss-Newton method for penalized nonlinear least squares problems (Q279318) (← links)
• A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization (Q429459) (← links)
• A convergence analysis for directional two-step Newton methods (Q607524) (← links)
• Fast Moreau envelope computation I: Numerical algorithms (Q870763) (← links)
• New conjugacy condition and related new conjugate gradient methods for unconstrained optimization (Q875393) (← links)
• Two parallel distribution algorithms for convex constrained minimization problems (Q884654) (← links)
• Convergence analysis of a variant of the Newton method for solving nonlinear equations (Q980135) (← links)
• Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization (Q1938913) (← links)
• A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization (Q1985287) (← links)
• Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions (Q2200083) (← links)
• A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs (Q2252688) (← links)
• Asymptotic Convergence Analysis of a New Class of Proximal Point Methods (Q3525933) (← links)
• (Q4693683) (← links)
• An efficient conjugate gradient method with strong convergence properties for non-smooth optimization (Q5025110) (← links)
• Some new step-size rules for optimization problems (Q5436239) (← links)
• Minimizing and stationary sequences of convex constrained minimization problems (Q5958080) (← links)