scientific article

Publication date: 2 March 2011

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

fast gradient-based methods smooth and nonsmooth minimization problems

Applications of mathematical programming (90C90) Nonlinear programming (90C30) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Methods of reduced gradient type (90C52)

Related Items

On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions, Enhanced flow direction arithmetic optimization algorithm for mathematical optimization problems with applications of data clustering, On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems, An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem, A Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems, On some steplength approaches for proximal algorithms, Sparse Bayesian learning for network structure reconstruction based on evolutionary game data, Stability of Over-Relaxations for the Forward-Backward Algorithm, Application to FISTA, Sensitivity Analysis for Mirror-Stratifiable Convex Functions, A semi-alternating algorithm for solving nonconvex split equality problems, Computational Spectral and Ultrafast Imaging via Convex Optimization, Non-convex split Feasibility problems: models, algorithms and theory, A closer look at consistent operator splitting and its extensions for topology optimization, Split Bregman iteration for multi-period mean variance portfolio optimization, A scaled gradient method for digital tomographic image reconstruction, Backward-forward algorithms for structured monotone inclusions in Hilbert spaces, Combining approximation and exact penalty in hierarchical programming, Quadratic growth conditions and uniqueness of optimal solution to Lasso, Nonconvex mixed TV/Cahn-Hilliard functional for super-resolution/segmentation of 3D trabecular bone images, Planar quintic \(G^2\) Hermite interpolation with minimum strain energy, Adaptive \(l_1\)-regularization for short-selling control in portfolio selection, Convex Bi-level Optimization Problems with Nonsmooth Outer Objective Function, Three new iterative methods for solving inclusion problems and related problems, Practical perspectives on symplectic accelerated optimization, Unnamed Item, Finding second-order stationary points in constrained minimization: a feasible direction approach, First-order methods for convex optimization, Convex approximations to sparse PCA via Lagrangian duality, Variational Gram Functions: Convex Analysis and Optimization, A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems, Independent component analysis based on fast proximal gradient, On FISTA with a relative error rule, Random algorithms for convex minimization problems, Incremental proximal methods for large scale convex optimization, The 2-coordinate descent method for solving double-sided simplex constrained minimization problems, A fast homotopy algorithm for gridless sparse recovery, Operator-valued kernel-based vector autoregressive models for network inference, Fused Lasso approach in portfolio selection, FOM – a MATLAB toolbox of first-order methods for solving convex optimization problems, On the impact of predictor geometry on the performance on high-dimensional ridge-regularized generalized robust regression estimators, Performance of first-order methods for smooth convex minimization: a novel approach, Functional response regression analysis, A First Order Method for Solving Convex Bilevel Optimization Problems, Templates for convex cone problems with applications to sparse signal recovery, Sensitivity analysis for inference with partially identifiable covariance matrices, Asymptotic properties on high-dimensional multivariate regression M-estimation, Proximal algorithms and temporal difference methods for solving fixed point problems, On the linear convergence of forward-backward splitting method. I: Convergence analysis, Proximal algorithms in statistics and machine learning, Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs, Linearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity condition, A viscosity-proximal gradient method with inertial extrapolation for solving certain minimization problems in Hilbert space, An Iterative Sparse-Group Lasso, Bregman primal-dual first-order method and application to sparse semidefinite programming, Fast selection of nonlinear mixed effect models using penalized likelihood, Proximal-Like Incremental Aggregated Gradient Method with Linear Convergence Under Bregman Distance Growth Conditions, The forward-backward splitting method for non-Lipschitz continuous minimization problems in Banach spaces, A dual Bregman proximal gradient method for relatively-strongly convex optimization, A primal-dual flow for affine constrained convex optimization