Pages that link to "Item:Q128676"
From MaRDI portal
The following pages link to Smooth minimization of non-smooth functions (Q128676):
Displaying 50 items.
- Proximal Methods for Sparse Optimal Scoring and Discriminant Analysis (Q97534) (← links)
- Primal-dual subgradient methods for convex problems (Q116219) (← links)
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints (Q255080) (← links)
- Half-linear regularization for nonconvex image restoration models (Q255993) (← links)
- A note on the complexity of proximal iterative hard thresholding algorithm (Q259117) (← links)
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming (Q263185) (← links)
- The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems (Q274096) (← links)
- An adaptive accelerated first-order method for convex optimization (Q276852) (← links)
- Best subset selection via a modern optimization lens (Q282479) (← links)
- Inertial Douglas-Rachford splitting for monotone inclusion problems (Q299664) (← links)
- A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints (Q301677) (← links)
- Stability and experimental comparison of prototypical iterative schemes for total variation regularized problems (Q302250) (← links)
- OSGA: a fast subgradient algorithm with optimal complexity (Q304218) (← links)
- A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron (Q304258) (← links)
- Optimized first-order methods for smooth convex minimization (Q312663) (← links)
- A dual method for minimizing a nonsmooth objective over one smooth inequality constraint (Q312667) (← links)
- Gradient sliding for composite optimization (Q312670) (← links)
- On the ergodic convergence rates of a first-order primal-dual algorithm (Q312675) (← links)
- On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients (Q315517) (← links)
- New results on subgradient methods for strongly convex optimization problems with a unified analysis (Q316174) (← links)
- Fast convex optimization via inertial dynamics with Hessian driven damping (Q324582) (← links)
- Color image processing by vectorial total variation with gradient channels coupling (Q326389) (← links)
- Efficient numerical methods for entropy-linear programming problems (Q327229) (← links)
- An inexact accelerated proximal gradient method and a dual Newton-CG method for the maximal entropy problem (Q353167) (← links)
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems (Q354625) (← links)
- Gradient methods for minimizing composite functions (Q359630) (← links)
- Computing equilibria in economies with incomplete markets, collateral and default penalties (Q363584) (← links)
- ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals (Q372857) (← links)
- The geometry of least squares in the 21st century (Q373539) (← links)
- Solving optimal stopping problems via empirical dual optimization (Q373842) (← links)
- Sparse non Gaussian component analysis by semidefinite programming (Q374189) (← links)
- Clustering and feature selection using sparse principal component analysis (Q374668) (← links)
- Fast alternating linearization methods for minimizing the sum of two convex functions (Q378095) (← links)
- Multiscale texture extraction with hierarchical \((BV,G_{p},L^2)\) decomposition (Q385316) (← links)
- Accelerated training of max-margin Markov networks with kernels (Q391744) (← links)
- Domain adaptation and sample bias correction theory and algorithm for regression (Q391745) (← links)
- First-order methods of smooth convex optimization with inexact oracle (Q403634) (← links)
- Subgradient methods for huge-scale optimization problems (Q403646) (← links)
- Fast first-order methods for composite convex optimization with backtracking (Q404292) (← links)
- A class of distributed optimization methods with event-triggered communication (Q404510) (← links)
- Model-based multiple rigid object detection and registration in unstructured range data (Q408868) (← links)
- Operator splittings, Bregman methods and frame shrinkage in image processing (Q408893) (← links)
- Sparse occlusion detection with optical flow (Q409201) (← links)
- A majorization-minimization approach to the sparse generalized eigenvalue problem (Q413888) (← links)
- First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games (Q431003) (← links)
- An optimal method for stochastic composite optimization (Q431018) (← links)
- An implementable proximal point algorithmic framework for nuclear norm minimization (Q431025) (← links)
- Implementation of an optimal first-order method for strongly convex total variation regularization (Q438730) (← links)
- Smoothing proximal gradient method for general structured sparse regression (Q439167) (← links)
- Interior point methods 25 years later (Q439546) (← links)
