Logarithmic integral optimization via adaptive importance sampling based surrogation methods
From MaRDI portal
Cites work
- A Single Timescale Stochastic Approximation Method for Nested Stochastic Optimization
- Adaptive importance sampling for efficient stochastic root finding and quantile estimation
- Adaptive importance sampling in monte carlo integration
- An efficient Markov chain Monte Carlo method for distributions with intractable normalising constants
- Bayesian Disease Mapping
- Bayesian image restoration, with two applications in spatial statistics (with discussion)
- Bayesian model comparison with un-normalised likelihoods
- Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix
- Estimation and annealing for Gibbsian fields
- Gaussian processes for machine learning.
- Graphical models, exponential families, and variational inference
- scientific article; zbMATH DE number 4088961 (Why is no real title available?)
- scientific article; zbMATH DE number 954974 (Why is no real title available?)
- scientific article; zbMATH DE number 176392 (Why is no real title available?)
- scientific article; zbMATH DE number 3513115 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 1324223 (Why is no real title available?)
- scientific article; zbMATH DE number 509169 (Why is no real title available?)
- scientific article; zbMATH DE number 3449561 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 2117879 (Why is no real title available?)
- Importance sampling in stochastic programming: a Markov chain Monte Carlo approach
- Lectures on Stochastic Programming
- Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
- Linear-step solvability of some folded concave and singly-parametric sparse optimization problems
- Maximum‐likelihood estimation for constrained‐ or missing‐data models
- Modern nonconvex nondifferentiable optimization
- Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs
- Multilevel stochastic gradient methods for nested composition optimization
- Nonconvex and nonsmooth approaches for affine chance-constrained stochastic programs
- Parameter estimation in Markov random field image modeling with imperfect observations. A comparative study
- Risk-Based Robust Statistical Learning by Stochastic Difference-of-Convex Value-Function Optimization
- Sample average approximation method for compound stochastic optimization problems
- Sample complexity of sample average approximation for conditional stochastic optimization
- Simulating normalizing constants: From importance sampling to bridge sampling to path sampling
- Solving Nonsmooth and Nonconvex Compound Stochastic Programs with Applications to Risk Measure Minimization
- Statistical estimation of composite risk functionals and risk optimization problems
- Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions
- Stochastic Optimization with Decision-Dependent Distributions
- Two-Stage Stochastic Programming with Linearly Bi-parameterized Quadratic Recourse
This page was built for publication: Logarithmic integral optimization via adaptive importance sampling based surrogation methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7349067)
