Pages that link to "Item:Q404292"

The following pages link to Fast first-order methods for composite convex optimization with backtracking (Q404292):

Displaying 25 items.

• Fast alternating linearization methods for minimizing the sum of two convex functions (Q378095) (← links)
• Inexact proximal Newton methods for self-concordant functions (Q522088) (← links)
• A scaled and adaptive FISTA algorithm for signal-dependent sparse image super-resolution problems (Q826178) (← links)
• Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates (Q1744900) (← links)
• Accelerated linearized Bregman method (Q1945379) (← links)
• On the interplay between acceleration and identification for the proximal gradient algorithm (Q2023654) (← links)
• Globalized inexact proximal Newton-type methods for nonconvex composite functions (Q2028488) (← links)
• Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems (Q2082554) (← links)
• Inertial proximal incremental aggregated gradient method with linear convergence guarantees (Q2084299) (← links)
• Additive Schwarz methods for convex optimization with backtracking (Q2122660) (← links)
• Accelerated methods with fastly vanishing subgradients for structured non-smooth minimization (Q2129627) (← links)
• An accelerated forward-backward algorithm with a new linesearch for convex minimization problems and its applications (Q2133344) (← links)
• Second order semi-smooth proximal Newton methods in Hilbert spaces (Q2141359) (← links)
• Convergence rate of inertial proximal algorithms with general extrapolation and proximal coefficients (Q2189628) (← links)
• Network classification with applications to brain connectomics (Q2281212) (← links)
• Mirror Prox algorithm for multi-term composite minimization and semi-separable problems (Q2350862) (← links)
• Accelerated Bregman operator splitting with backtracking (Q2408418) (← links)
• An abstract convergence framework with application to inertial inexact forward-backward methods (Q2696904) (← links)
• Proximal extrapolated gradient methods for variational inequalities (Q4638915) (← links)
• An Optimal High-Order Tensor Method for Convex Optimization (Q5026443) (← links)
• Exact gradient methods with memory (Q5058416) (← links)
• A Unified Adaptive Tensor Approximation Scheme to Accelerate Composite Convex Optimization (Q5131958) (← links)
• Backtracking Strategies for Accelerated Descent Methods with Smooth Composite Objectives (Q5231684) (← links)
• Scaled, Inexact, and Adaptive Generalized FISTA for Strongly Convex Optimization (Q5869821) (← links)
• A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program (Q6175368) (← links)