Pages that link to "Item:Q2810547"

The following pages link to On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications (Q2810547):

Displaying 21 items.

• Convergence rates of subgradient methods for quasi-convex optimization problems (Q782917) (← links)
• Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems (Q1630420) (← links)
• Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems (Q2007835) (← links)
• Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions (Q2010105) (← links)
• Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems (Q2022292) (← links)
• Quasi-convex feasibility problems: subgradient methods and convergence rates (Q2076909) (← links)
• Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems (Q2129140) (← links)
• Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces (Q2141725) (← links)
• Damped Newton's method on Riemannian manifolds (Q2182864) (← links)
• A family of projection gradient methods for solving the multiple-sets split feasibility problem (Q2275325) (← links)
• An adaptive fixed-point proximity algorithm for solving total variation denoising models (Q2293175) (← links)
• On the superlinear convergence of Newton's method on Riemannian manifolds (Q2412834) (← links)
• A dynamical system method for solving the split convex feasibility problem (Q2666702) (← links)
• The equivalence of three types of error bounds for weakly and approximately convex functions (Q2671442) (← links)
• Optimality conditions for composite DC infinite programming problems (Q2691286) (← links)
• Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications (Q2694483) (← links)
• Strong Metric (Sub)regularity of Karush–Kuhn–Tucker Mappings for Piecewise Linear-Quadratic Convex-Composite Optimization and the Quadratic Convergence of Newton’s Method (Q3387919) (← links)
• Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee (Q5088832) (← links)
• Riemannian linearized proximal algorithms for nonnegative inverse eigenvalue problem (Q6141535) (← links)
• A successive centralized circumcentered-reflection method for the convex feasibility problem (Q6179873) (← links)
• A modified inexact Levenberg-Marquardt method with the descent property for solving nonlinear equations (Q6179880) (← links)