Pages that link to "Item:Q359630"

The following pages link to Gradient methods for minimizing composite functions (Q359630):

Displaying 50 items.

• Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg–Marquardt methods (Q5038173) (← links)
• Inexact basic tensor methods for some classes of convex optimization problems (Q5043845) (← links)
• Gradient methods with memory (Q5043847) (← links)
• A tight smooth approximation of the maximum function and its applications (Q5055095) (← links)
• Diminishing stepsize methods for nonconvex composite problems via ghost penalties: from the general to the convex regular constrained case (Q5058371) (← links)
• Hard Thresholding Regularised Logistic Regression: Theory and Algorithms (Q5061727) (← links)
• Identifying Heterogeneous Effect Using Latent Supervised Clustering With Adaptive Fusion (Q5066414) (← links)
• An Efficient Algorithm for Minimizing Multi Non-Smooth Component Functions (Q5066427) (← links)
• Accelerated Optimization in the PDE Framework: Formulations for the Manifold of Diffeomorphisms (Q5068854) (← links)
• Stochastic Multilevel Composition Optimization Algorithms with Level-Independent Convergence Rates (Q5072589) (← links)
• A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer (Q5072590) (← links)
• A New Homotopy Proximal Variable-Metric Framework for Composite Convex Minimization (Q5076711) (← links)
• Accelerated Stochastic Algorithms for Convex-Concave Saddle-Point Problems (Q5085148) (← links)
• Primal–dual accelerated gradient methods with small-dimensional relaxation oracle (Q5085262) (← links)
• A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure (Q5086011) (← links)
• A Scalable Algorithm for Sparse Portfolio Selection (Q5087719) (← links)
• Fast convergence of generalized forward-backward algorithms for structured monotone inclusions (Q5091986) (← links)
• Potential Function-Based Framework for Minimizing Gradients in Convex and Min-Max Optimization (Q5093649) (← links)
• Scheduled Restart Momentum for Accelerated Stochastic Gradient Descent (Q5094616) (← links)
• First-Order Methods for Problems with $O$(1) Functional Constraints Can Have Almost the Same Convergence Rate as for Unconstrained Problems (Q5097011) (← links)
• A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions (Q5099775) (← links)
• Additive Schwarz Methods for Convex Optimization as Gradient Methods (Q5110553) (← links)
• A Forward-Backward Splitting Method for Monotone Inclusions Without Cocoercivity (Q5114393) (← links)
• Fast First-Order Methods for Minimizing Convex Composite Functions (Q5127658) (← links)
• A Unified Adaptive Tensor Approximation Scheme to Accelerate Composite Convex Optimization (Q5131958) (← links)
• Contracting Proximal Methods for Smooth Convex Optimization (Q5139832) (← links)
• Accelerated Optimization in the PDE Framework Formulations for the Active Contour Case (Q5143324) (← links)
• (Q5148937) (← links)
• Inexact primal–dual gradient projection methods for nonlinear optimization on convex set (Q5151505) (← links)
• (Q5152050) (← links)
• Efficient Search of First-Order Nash Equilibria in Nonconvex-Concave Smooth Min-Max Problems (Q5158768) (← links)
• (Q5159402) (← links)
• DISTRIBUTED PROXIMAL-GRADIENT METHOD FOR CONVEX OPTIMIZATION WITH INEQUALITY CONSTRAINTS (Q5174338) (← links)
• Finite element approximation of source term identification with TV-regularization (Q5204631) (← links)
• Data-Driven Nonsmooth Optimization (Q5210515) (← links)
• Sharpness, Restart, and Acceleration (Q5210521) (← links)
• (Q5214181) (← links)
• (Q5214241) (← links)
• Generalized Conjugate Gradient Methods for <i>ℓ</i>₁ Regularized Convex Quadratic Programming with Finite Convergence (Q5219295) (← links)
• A Single-Phase, Proximal Path-Following Framework (Q5219702) (← links)
• On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming (Q5219732) (← links)
• Imaging with highly incomplete and corrupted data (Q5220309) (← links)
• Composite Optimization by Nonconvex Majorization-Minimization (Q5230420) (← links)
• An Inexact Variable Metric Proximal Point Algorithm for Generic Quasi-Newton Acceleration (Q5231671) (← links)
• Backtracking Strategies for Accelerated Descent Methods with Smooth Composite Objectives (Q5231684) (← links)
• Solving Large-Scale Optimization Problems with a Convergence Rate Independent of Grid Size (Q5232280) (← links)
• Variational Image Regularization with Euler's Elastica Using a Discrete Gradient Scheme (Q5236622) (← links)
• A scalable estimator of sets of integral operators (Q5236688) (← links)
• Gradient Method for Optimization on Riemannian Manifolds with Lower Bounded Curvature (Q5237307) (← links)
• Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs (Q5237309) (← links)