Incremental proximal methods for large scale convex optimization

DOI10.1007/s10107-011-0472-0zbMath1229.90121OpenAlexW2073750241MaRDI QIDQ644913

Publication date: 7 November 2011

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-011-0472-0

zbMATH Keywords

convex programming gradient method incremental method proximal algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90)

Related Items

An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems, Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems, Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis, A second-order TV-type approach for inpainting and denoising higher dimensional combined cyclic and vector space data, Dual averaging with adaptive random projection for solving evolving distributed optimization problems, Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays, Sparse reduced-rank regression for multivariate varying-coefficient models, Sub-linear convergence of a stochastic proximal iteration method in Hilbert space, Unnamed Item, On the Convergence of Stochastic Primal-Dual Hybrid Gradient, Decentralized proximal splitting algorithms for composite constrained convex optimization, Incremental gradient-free method for nonsmooth distributed optimization, Sublinear Convergence of a Tamed Stochastic Gradient Descent Method in Hilbert Space, AIR tools II: algebraic iterative reconstruction methods, improved implementation, Dual decomposition for multi-agent distributed optimization with coupling constraints, Two proximal splitting methods in Hadamard spaces, Old and new challenges in Hadamard spaces, Composite optimization with coupling constraints via dual proximal gradient method with applications to asynchronous networks, Sparse and Low-Rank Matrix Quantile Estimation With Application to Quadratic Regression, Circuit analysis using monotone+skew splitting, An asynchronous subgradient-proximal method for solving additive convex optimization problems, Linear convergence of cyclic SAGA, Inexact proximal stochastic gradient method for convex composite optimization, Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality, Wavelet Sparse Regularization for Manifold-Valued Data, Statistical performance of quantile tensor regression with convex regularization, Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs, Nonlinear functional canonical correlation analysis via distance covariance, Discriminative Bayesian filtering lends momentum to the stochastic Newton method for minimizing log-convex functions, Random algorithms for convex minimization problems, Two stochastic optimization algorithms for convex optimization with fixed point constraints, An Asynchronous Bundle-Trust-Region Method for Dual Decomposition of Stochastic Mixed-Integer Programming, Forward-reflected-backward method with variance reduction, Non-smooth Variational Regularization for Processing Manifold-Valued Data, Manifold-Valued Data in Medical Imaging Applications, Relative Optimality Conditions and Algorithms for Treespace Fréchet Means, Subgradient algorithms on Riemannian manifolds of lower bounded curvatures, A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints, Global Convergence Rate of Proximal Incremental Aggregated Gradient Methods, Surpassing Gradient Descent Provably: A Cyclic Incremental Method with Linear Convergence Rate, Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions, A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions, Near-optimal stochastic approximation for online principal component estimation, DC programming and DCA: thirty years of developments, Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization, Distributed optimization with information-constrained population dynamics, DISTRIBUTED PROXIMAL-GRADIENT METHOD FOR CONVEX OPTIMIZATION WITH INEQUALITY CONSTRAINTS, Convergence of the surrogate Lagrangian relaxation method, Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions, Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems, Gradient-free method for nonsmooth distributed optimization, Parametric and semiparametric reduced-rank regression with flexible sparsity, Rank reduction for high-dimensional generalized additive models, A Second Order Nonsmooth Variational Model for Restoring Manifold-Valued Images, The Averaged Kaczmarz Iteration for Solving Inverse Problems, Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications, Forward-Backward-Half Forward Algorithm for Solving Monotone Inclusions, Exponential convergence of distributed primal-dual convex optimization algorithm without strong convexity, Hierarchical MPC schemes for periodic systems using stochastic programming, Unnamed Item, Total Generalized Variation for Manifold-Valued Data, Dynamical behavior of a stochastic forward-backward algorithm using random monotone operators, Stochastic First-Order Methods with Random Constraint Projection, Modified Fejér sequences and applications, On the analysis of variance-reduced and randomized projection variants of single projection schemes for monotone stochastic variational inequality problems, Generalized row-action methods for tomographic imaging, Communication-efficient algorithms for decentralized and stochastic optimization, Discrete-time gradient flows and law of large numbers in Alexandrov spaces, Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities, Decentralized hierarchical constrained convex optimization, Path-based incremental target level algorithm on Riemannian manifolds, Stochastic DCA for minimizing a large sum of DC functions with application to multi-class logistic regression, Analysis of stochastic gradient descent in continuous time, Limited-angle CT reconstruction with generalized shrinkage operators as regularizers, Ergodic Convergence of a Stochastic Proximal Point Algorithm, Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity, Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization, Proximal-Like Incremental Aggregated Gradient Method with Linear Convergence Under Bregman Distance Growth Conditions, Make \(\ell_1\) regularization effective in training sparse CNN, Incremental proximal gradient scheme with penalization for constrained composite convex optimization problems, Parseval proximal neural networks, Consensus-based distributed optimisation of multi-agent networks via a two level subgradient-proximal algorithm, Random minibatch subgradient algorithms for convex problems with functional constraints, Incremental constraint projection methods for variational inequalities, Estimation of a sparse and spiked covariance matrix, Splitting proximal with penalization schemes for additive convex hierarchical minimization problems, An Inexact Semismooth Newton Method on Riemannian Manifolds with Application to Duality-Based Total Variation Denoising, Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity, Combined first and second order variational approaches for image processing, A hybrid stochastic optimization framework for composite nonconvex optimization

Uses Software

TwIST

Cites Work