Proximal oracles for optimization and sampling
From MaRDI portal
Cites work
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes
- A random polynomial-time algorithm for approximating the volume of convex bodies
- A single cut proximal bundle method for stochastic convex composite optimization
- A unified analysis of a class of proximal bundle methods for solving hybrid convex composite optimization problems
- An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
- An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems
- An optimal high-order tensor method for convex optimization
- Analysis of Langevin Monte Carlo via convex optimization
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
- Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Efficiency of proximal bundle methods
- Efficient Bayesian computation by proximal Markov chain Monte Carlo: when Langevin meets Moreau
- Exponential convergence of Langevin distributions and their discrete approximations
- First-order methods in optimization
- Generalized Bundle Methods
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- scientific article; zbMATH DE number 3559294 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 3619637 (Why is no real title available?)
- scientific article; zbMATH DE number 646825 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers
- Langevin diffusions and Metropolis-Hastings algorithms
- MCMC using Hamiltonian dynamics
- Monotone Operators and the Proximal Point Algorithm
- New variants of bundle methods
- Nonasymptotic mixing of the MALA algorithm
- On optimal universal first-order methods for minimizing heterogeneous sums
- Optimal Convergence Rates for the Proximal Bundle Method
- Optimal methods of smooth convex minimization
- Probabilistic optimization via approximate \(p\)-efficient points and bundle methods
- Random walks and anO*(n5) volume algorithm for convex bodies
- Rate of convergence of the bundle method
- Simulated Annealing for Convex Optimization
- Solving convex programs by random walks
- Statistical mechanics: Algorithms and computations. With CD-ROM.
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- The Variational Formulation of the Fokker--Planck Equation
- Theoretical Guarantees for Approximate Sampling from Smooth and Log-Concave Densities
- Universal gradient methods for convex optimization problems
This page was built for publication: Proximal oracles for optimization and sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6850360)
