Point process estimation with Mirror Prox algorithms
From MaRDI portal
Publication:2019904
DOI10.1007/S00245-019-09634-6zbMATH Open1461.60033OpenAlexW2990042492WikidataQ126665316 ScholiaQ126665316MaRDI QIDQ2019904FDOQ2019904
Le Song, Niao He, Zaid Harchaoui, Yichen Wang
Publication date: 22 April 2021
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00245-019-09634-6
Recommendations
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Convex and non-convex regularization methods for spatial point processes intensity estimation
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems
- A randomized mirror-prox method for solving structured large-scale matrix saddle-point problems
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Self-Exciting Point Process Modeling of Crime
- Smooth minimization of non-smooth functions
- Tracking Dynamic Point Processes on Networks
- Gradient methods for minimizing composite functions
- First-Order Methods in Optimization
- Smoothing proximal gradient method for general structured sparse regression
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- The ordered subsets mirror descent optimization method with applications to tomography
- Robust Stochastic Approximation Approach to Stochastic Programming
- Title not available (Why is that?)
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Optimization with sparsity-inducing penalties
- Image deblurring with Poisson data: from cells to galaxies
- Bregman Monotone Optimization Algorithms
- Restoration of Poissonian Images Using Alternating Direction Optimization
- Proximité et dualité dans un espace hilbertien
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Stochastic Block Mirror Descent Methods for Nonsmooth and Stochastic Optimization
- This is SPIRAL-TAP: Sparse Poisson Intensity Reconstruction ALgorithms—Theory and Practice
- Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization
- Convex analysis and monotone operator theory in Hilbert spaces
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization
- Optimal Primal-Dual Methods for a Class of Saddle Point Problems
- Option pricing with a general marked point process.
- Composite Self-Concordant Minimization
- Minimizing finite sums with the stochastic average gradient
- An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems
- Randomized primal-dual proximal block coordinate updates
- Relatively Smooth Convex Optimization by First-Order Methods, and Applications
- A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
- An efficient primal dual prox method for non-smooth optimization
- On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities: randomized block coordinate and optimal averaging schemes
- Derivatives pricing with marked point processes using tick-by-tick data
Uses Software
This page was built for publication: Point process estimation with Mirror Prox algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019904)
