Pages that link to "Item:Q359630"
From MaRDI portal
The following pages link to Gradient methods for minimizing composite functions (Q359630):
Displaying 50 items.
- Generalized uniformly optimal methods for nonlinear programming (Q2316202) (← links)
- Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms (Q2316618) (← links)
- Computational and statistical analyses for robust non-convex sparse regularized regression problem (Q2317291) (← links)
- Survival analysis of DNA mutation motifs with penalized proportional hazards (Q2318685) (← links)
- Convergence analysis of the relaxed proximal point algorithm (Q2319250) (← links)
- Generalized self-concordant functions: a recipe for Newton-type methods (Q2330645) (← links)
- Efficiency of minimizing compositions of convex functions and smooth maps (Q2330660) (← links)
- A relax inexact accelerated proximal gradient method for the constrained minimization problem of maximum eigenvalue functions (Q2336689) (← links)
- Generalized affine scaling algorithms for linear programming problems (Q2337378) (← links)
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems (Q2350862) (← links)
- An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization (Q2352420) (← links)
- On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions (Q2359139) (← links)
- Majorization-minimization generalized Krylov subspace methods for \({\ell _p}\)-\({\ell _q}\) optimization applied to image restoration (Q2359752) (← links)
- Forward-backward quasi-Newton methods for nonsmooth optimization problems (Q2364124) (← links)
- Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems (Q2374363) (← links)
- Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization (Q2374365) (← links)
- On the iteration complexity of some projection methods for monotone linear variational inequalities (Q2397469) (← links)
- Combining fast inertial dynamics for convex optimization with Tikhonov regularization (Q2408626) (← links)
- Scattered data interpolation with nonnegative preservation using bivariate splines and its application (Q2409707) (← links)
- Linear convergence of first order methods for non-strongly convex optimization (Q2414900) (← links)
- An optimal subgradient algorithm with subspace search for costly convex optimization problems (Q2415906) (← links)
- Inexact successive quadratic approximation for regularized optimization (Q2419525) (← links)
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems (Q2419543) (← links)
- Iteratively reweighted \(\ell _1\) algorithms with extrapolation (Q2419549) (← links)
- Empirical risk minimization: probabilistic complexity and stepsize strategy (Q2419551) (← links)
- Accelerated randomized mirror descent algorithms for composite non-strongly convex optimization (Q2420797) (← links)
- Block-wise ADMM with a relaxation factor for multiple-block convex programming (Q2422129) (← links)
- Accelerated gradient boosting (Q2425242) (← links)
- The PPA-based numerical algorithm with the \(O(1/t)\) convergence rate for variant variational inequalities (Q2448215) (← links)
- Accelerated additive Schwarz methods for convex optimization with adaptive restart (Q2666023) (← links)
- A proximal algorithm with backtracked extrapolation for a class of structured fractional programming (Q2667040) (← links)
- First-order frameworks for continuous Newton-like dynamics governed by maximally monotone operators (Q2670974) (← links)
- Fast gradient methods for uniformly convex and weakly smooth problems (Q2673504) (← links)
- Optimal combination of tensor optimization methods (Q2679782) (← links)
- Affine-invariant contracting-point methods for convex optimization (Q2687041) (← links)
- Convergence rates of the heavy-ball method under the Łojasiewicz property (Q2687044) (← links)
- Perturbed Fenchel duality and first-order methods (Q2687051) (← links)
- A primal and dual active set algorithm for truncated \(L_1\) regularized logistic regression (Q2691265) (← links)
- A simple nearly optimal restart scheme for speeding up first-order methods (Q2696573) (← links)
- On FISTA with a relative error rule (Q2696903) (← links)
- A smoothing proximal gradient algorithm with extrapolation for the relaxation of \({\ell_0}\) regularization problem (Q2696923) (← links)
- Majorization-minimization-based Levenberg-Marquardt method for constrained nonlinear least squares (Q2696927) (← links)
- Fast convergence of inertial gradient dynamics with multiscale aspects (Q2696950) (← links)
- The impact of noise on evaluation complexity: the deterministic trust-region case (Q2696963) (← links)
- Complexity Certifications of First-Order Inexact Lagrangian Methods for General Convex Programming: Application to Real-Time MPC (Q2798546) (← links)
- On convergence rates of linearized proximal algorithms for convex composite optimization with applications (Q2810547) (← links)
- Iteration complexity analysis of dual first-order methods for conic convex programming (Q2815553) (← links)
- A family of subgradient-based methods for convex optimization problems in a unifying framework (Q2829570) (← links)
- On the convergence of the forward–backward splitting method with linesearches (Q2829582) (← links)
- A subgradient method for free material design (Q2832891) (← links)
