Pages that link to "Item:Q359630"

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

Displaying 41 items.

• A diagonal finite element-projection-proximal gradient algorithm for elliptic optimal control problem (Q6048981) (← links)
• A speed restart scheme for a dynamics with Hessian-driven damping (Q6086152) (← links)
• Conditions for linear convergence of the gradient method for non-convex optimization (Q6097482) (← links)
• Branch-and-Model: a derivative-free global optimization algorithm (Q6097758) (← links)
• Linearly-convergent FISTA variant for composite optimization with duality (Q6101606) (← links)
• An accelerated tensorial double proximal gradient method for total variation regularization problem (Q6108976) (← links)
• A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems (Q6110456) (← links)
• Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem (Q6111359) (← links)
• Hyperfast second-order local solvers for efficient statistically preconditioned distributed optimization (Q6114954) (← links)
• Direct nonlinear acceleration (Q6114957) (← links)
• Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence (Q6116237) (← links)
• FISTA is an automatic geometrically optimized algorithm for strongly convex functions (Q6120847) (← links)
• Decentralized Gradient Descent Maximization Method for Composite Nonconvex Strongly-Concave Minimax Problems (Q6130542) (← links)
• Optimal Algorithms for Stochastic Complementary Composite Minimization (Q6136660) (← links)
• N-mode minimal tensor extrapolation methods (Q6140891) (← links)
• A class of modified accelerated proximal gradient methods for nonsmooth and nonconvex minimization problems (Q6145571) (← links)
• On a scaled symmetric Dai-Liao-type scheme for constrained system of nonlinear equations with applications (Q6150644) (← links)
• Efficiency of higher-order algorithms for minimizing composite functions (Q6155068) (← links)
• Proximal quasi-Newton method for composite optimization over the Stiefel manifold (Q6159020) (← links)
• A refined inertial DC algorithm for DC programming (Q6159465) (← links)
• An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems (Q6164017) (← links)
• A reduced half thresholding algorithm (Q6164988) (← links)
• Faster first-order primal-dual methods for linear programming using restarts and sharpness (Q6165583) (← links)
• Principled analyses and design of first-order methods with inexact proximal operators (Q6165584) (← links)
• Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification (Q6165598) (← links)
• Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization (Q6166657) (← links)
• First-order methods for convex optimization (Q6169988) (← links)
• Data-Driven Mirror Descent with Input-Convex Neural Networks (Q6171691) (← links)
• Minimizing oracle-structured composite functions (Q6173766) (← links)
• A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program (Q6175368) (← links)
• Optimal Transport Approximation of 2-Dimensional Measures (Q6175992) (← links)
• An inexact primal-dual smoothing framework for large-scale non-bilinear saddle point problems (Q6182323) (← links)
• Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems (Q6182324) (← links)
• Homogenization with the quasistatic Tresca friction law: qualitative and quantitative results (Q6183900) (← links)
• An \(\ell_{2,0}\)-norm constrained matrix optimization via extended discrete first-order algorithms (Q6187383) (← links)
• Supervised homogeneity fusion: a combinatorial approach (Q6192329) (← links)
• Adaptive proximal SGD based on new estimating sequences for sparser ERM (Q6196471) (← links)
• A semismooth Newton stochastic proximal point algorithm with variance reduction (Q6490309) (← links)
• Accelerated gradient methods for sparse statistical learning with nonconvex penalties (Q6494394) (← links)
• SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization (Q6498409) (← links)
• Accelerated forward–backward algorithms for structured monotone inclusions (Q6498412) (← links)