Point process estimation with Mirror Prox algorithms
type: Item
instance of: scholarly article
title: Point process estimation with Mirror Prox algorithms
zbMATH Open document ID: 1461.60033
author: Niao He
author: Zaid Harchaoui
author: Yichen Wang
author: Le Song
published in: Applied Mathematics and Optimization
publication date: 2021-04-22T00:00:00Z
Mathematics Subject Classification ID: 60G55
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 7336651
zbMATH Keywords: Mirror Prox
zbMATH Keywords: proximal algorithm
zbMATH Keywords: point process
zbMATH Keywords: saddle point problem
describes a project that uses: SPIRAL
MaRDI profile type: Publication
full work available at URL: s00245-019-09634-6
OpenAlex ID: W2990042492
cites work: Image deblurring with Poisson data: from cells to galaxies
cites work: Option pricing with a general marked point process.
cites work: Derivatives pricing with marked point processes using tick-by-tick data
cites work: Tracking Dynamic Point Processes on Networks
cites work: Gradient methods for minimizing composite functions
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Robust Stochastic Approximation Approach to Stochastic Programming
cites work: Minimizing finite sums with the stochastic average gradient
cites work: This is SPIRAL-TAP: Sparse Poisson Intensity Reconstruction ALgorithms—Theory and Practice
cites work: Composite Self-Concordant Minimization
cites work: The ordered subsets mirror descent optimization method with applications to tomography
cites work: Q3967358
cites work: Restoration of Poissonian Images Using Alternating Direction Optimization
cites work: A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
cites work: Relatively Smooth Convex Optimization by First-Order Methods, and Applications
cites work: Self-Exciting Point Process Modeling of Crime
cites work: Proximité et dualité dans un espace hilbertien
cites work: Entropic Proximal Mappings with Applications to Nonlinear Programming
cites work: Bregman Monotone Optimization Algorithms
cites work: Optimization with sparsity-inducing penalties
cites work: Convex analysis and monotone operator theory in Hilbert spaces
cites work: Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
cites work: Efficiency of coordinate descent methods on huge-scale optimization problems
cites work: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
cites work: Mirror Prox algorithm for multi-term composite minimization and semi-separable problems
cites work: A first-order primal-dual algorithm for convex problems with applications to imaging
cites work: An efficient primal dual prox method for non-smooth optimization
cites work: On the ergodic convergence rates of a first-order primal-dual algorithm
cites work: Optimal Primal-Dual Methods for a Class of Saddle Point Problems
cites work: An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems
cites work: Smooth minimization of non-smooth functions
cites work: Smoothing proximal gradient method for general structured sparse regression
cites work: Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization
cites work: Stochastic Block Mirror Descent Methods for Nonsmooth and Stochastic Optimization
cites work: Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization
cites work: Randomized primal-dual proximal block coordinate updates
cites work: On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities: randomized block coordinate and optimal averaging schemes
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: First-Order Methods in Optimization
Wikidata QID: Q126665316
DOI: 10.1007/S00245-019-09634-6
description: scientific article; zbMATH DE number 7336651