Gradient methods for minimizing composite functions
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1906319 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A generalized proximal point algorithm for certain non-convex minimization problems
- Accelerating the cubic regularization of Newton's method on convex problems
- Atomic Decomposition by Basis Pursuit
- Introductory lectures on convex optimization. A basic course.
- Just relax: convex programming methods for identifying sparse signals in noise
- Linear Inversion of Band-Limited Reflection Seismograms
- Rounding of convex sets and efficient gradient methods for linear programming problems
- Smooth minimization of non-smooth functions
Cited in
(only showing first 100 items - show all)- An inexact interior-point Lagrangian decomposition algorithm with inexact oracles
- A Total Fractional-Order Variation Model for Image Restoration with Nonhomogeneous Boundary Conditions and Its Numerical Solution
- Inexact successive quadratic approximation for regularized optimization
- Perturbation resilience of proximal gradient algorithm for composite objectives
- A primal-dual flow for affine constrained convex optimization
- Accelerating the DC algorithm for smooth functions
- The cyclic block conditional gradient method for convex optimization problems
- Data-driven nonsmooth optimization
- Another look at the fast iterative shrinkage/thresholding algorithm (FISTA)
- scientific article; zbMATH DE number 7632133 (Why is no real title available?)
- Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming
- An optimal randomized incremental gradient method
- Inexact proximal stochastic gradient method for convex composite optimization
- GSDAR: a fast Newton algorithm for \(\ell_0\) regularized generalized linear models with statistical guarantee
- Limited-memory common-directions method for large-scale optimization: convergence, parallelization, and distributed optimization
- Alternating direction method of multipliers with variable metric indefinite proximal terms for convex optimization
- Linear convergence of first order methods for non-strongly convex optimization
- Fast gradient methods for uniformly convex and weakly smooth problems
- A self-calibrated direct approach to precision matrix estimation and linear discriminant analysis in high dimensions
- Catalyst acceleration for first-order convex optimization: from theory to practice
- An accelerated randomized proximal coordinate gradient method and its application to regularized empirical risk minimization
- Accelerated proximal algorithms with a correction term for monotone inclusions
- On the convergence rate of the augmented Lagrangian-based parallel splitting method
- A simple nearly optimal restart scheme for speeding up first-order methods
- A multilevel proximal gradient algorithm for a class of composite optimization problems
- Relatively smooth convex optimization by first-order methods, and applications
- A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure
- Randomized projection methods for convex feasibility: conditioning and convergence rates
- A control-theoretic perspective on optimal high-order optimization
- Generalized affine scaling algorithms for linear programming problems
- A proximal strictly contractive Peaceman-Rachford splitting method for convex programming with applications to imaging
- Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM
- Inertial proximal ADMM for linearly constrained separable convex optimization
- scientific article; zbMATH DE number 6860781 (Why is no real title available?)
- A unified approach to error bounds for structured convex optimization problems
- Consistent learning by composite proximal thresholding
- DC formulations and algorithms for sparse optimization problems
- Combining fast inertial dynamics for convex optimization with Tikhonov regularization
- Self adaptive inertial extragradient algorithms for solving bilevel pseudomonotone variational inequality problems
- Linesearch Newton-CG methods for convex optimization with noise
- Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems
- Accelerated residual methods for the iterative solution of systems of equations
- On convergence rates of linearized proximal algorithms for convex composite optimization with applications
- Proximal-proximal-gradient method
- Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
- ``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern?
- A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems
- A Scalable Algorithm for Sparse Portfolio Selection
- From differential equation solvers to accelerated first-order methods for convex optimization
- Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization
- Convergence rates of proximal gradient methods via the convex conjugate
- On the generation of sampling schemes for magnetic resonance imaging
- Decomposable norm minimization with proximal-gradient homotopy algorithm
- A projection method on measures sets
- Generalized uniformly optimal methods for nonlinear programming
- Iteration complexity analysis of dual first-order methods for conic convex programming
- Adaptive smoothing algorithms for nonsmooth composite convex minimization
- Sparse regression at scale: branch-and-bound rooted in first-order optimization
- Scattered data interpolation with nonnegative preservation using bivariate splines and its application
- Sorted concave penalized regression
- Convergence analysis of positive-indefinite proximal ADMM with a Glowinski's relaxation factor
- Generalized conjugate gradient methods for \(\ell_1\) regularized convex quadratic programming with finite convergence
- On the iteration complexity of some projection methods for monotone linear variational inequalities
- On the convergence analysis of the optimized gradient method
- scientific article; zbMATH DE number 6982301 (Why is no real title available?)
- Nonnegative data interpolation by spherical splines
- Convergence analysis of primal-dual based methods for total variation minimization with finite element approximation
- On group-wise \(\ell_p\) regularization: theory and efficient algorithms
- Adaptive restart of the optimized gradient method for convex optimization
- Exact worst-case convergence rates of the proximal gradient method for composite convex minimization
- Accelerating \(\ell^1\)-\(\ell^2\) deblurring using wavelet expansions of operators
- Convergence analysis of the relaxed proximal point algorithm
- Activity identification and local linear convergence of forward-backward-type methods
- Composite optimization by nonconvex majorization-minimization
- Sparse trace norm regularization
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- Accelerating block-decomposition first-order methods for solving composite saddle-point and two-player Nash equilibrium problems
- Efficiency of minimizing compositions of convex functions and smooth maps
- Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
- A level-set method for convex optimization with a feasible solution path
- Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems
- Accelerated Bregman proximal gradient methods for relatively smooth convex optimization
- Fast and safe: accelerated gradient methods with optimality certificates and underestimate sequences
- An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis
- An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization
- The condition number of a function relative to a set
- Generalized conditional gradient for sparse estimation
- Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms
- Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms
- Globalized inexact proximal Newton-type methods for nonconvex composite functions
- Nearly optimal first-order methods for convex optimization under gradient norm measure: an adaptive regularization approach
- Complexity bounds for primal-dual methods minimizing the model of objective function
- An alternating direction method of multipliers with the BFGS update for structured convex quadratic optimization
- Accelerated differential inclusion for convex optimization
- Accelerated regularized Newton methods for minimizing composite convex functions
- Iteratively reweighted \(\ell _1\) algorithms with extrapolation
- Iterative positive thresholding algorithm for non-negative sparse optimization
- Generalized self-concordant functions: a recipe for Newton-type methods
- Point process estimation with Mirror Prox algorithms
- Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems
This page was built for publication: Gradient methods for minimizing composite functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q359630)
