Approximations of semicontinuous functions with applications to stochastic optimization and statistical estimation
From MaRDI portal
Publication:2205979
DOI10.1007/s10107-019-01413-zzbMath1451.90108arXiv1709.06730OpenAlexW2963856277MaRDI QIDQ2205979
Publication date: 21 October 2020
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.06730
rate of convergencestochastic optimizationapproximation theoryepi-splinessolution stabilityAttouch-Wets distancehypo-convergence
Nonparametric regression and quantile regression (62G08) Density estimation (62G07) Nonparametric tolerance and confidence regions (62G15) Stochastic programming (90C15)
Related Items
Set-convergence and its application: a tutorial ⋮ Nonconvex and nonsmooth approaches for affine chance-constrained stochastic programs ⋮ Consistency of Monte Carlo estimators for risk-neutral PDE-constrained optimization ⋮ Sample average approximations of strongly convex stochastic programs in Hilbert spaces ⋮ Sample Size Estimates for Risk-Neutral Semilinear PDE-Constrained Optimization ⋮ Unnamed Item ⋮ Asymptotic Properties of Stationary Solutions of Coupled Nonconvex Nonsmooth Empirical Risk Minimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized decision rule approximations for stochastic programming via liftings
- Multivariate epi-splines and evolving function identification problems
- Global rates of convergence in log-concave density estimation
- Covering numbers of Gaussian reproducing kernel Hilbert spaces
- Nonparametric least squares estimation of a multivariate convex regression function
- Optimality functions in stochastic programming
- Global risk bounds and adaptation in univariate convex regression
- On functions representable as a difference of convex functions
- Statistical verification of optimality conditions for stochastic programs with recourse
- epsilon-entropy of convex sets and functions
- A simulation-based approach to two-stage stochastic programming with recourse
- A branch and bound method for stochastic global optimization
- Monte Carlo bounding techniques for determinig solution quality in stochastic programs
- Duality and statistical tests of optimality for two stage stochastic programs
- A note on different covering numbers in learning theory.
- Approximations and solution estimates in optimization
- Generalized conditioning based approaches to computing confidence intervals for solutions to stochastic variational inequalities
- Estimation of a convex function: Characterizations and asymptotic theory.
- The covering number in learning theory
- Weak convergence and empirical processes. With applications to statistics
- DC programming: overview.
- Metric entropy of some classes of sets with differentiable boundaries
- On univariate function identification problems
- Assessing solution quality in stochastic programs
- On covering numbers of sublevel sets of analytic functions
- Polynomial Approximations for Continuous Linear Programs
- Covering Numbers for Convex Functions
- K-Adaptability in Two-Stage Robust Binary Programming
- On the Convergence in Distribution of Measurable Multifunctions (Random Sets) Normal Integrands, Stochastic Processes and Stochastic Infima
- Covering numbers for real-valued function classes
- Variational Analysis
- Covering numbers for support vector machines
- Composite Difference-Max Programs for Modern Statistical Estimation Problems
- Maximum Likelihood Estimation of a Multi-Dimensional Log-Concave Density
- Variational Theory for Optimization under Stochastic Ambiguity
- Confidence Intervals and Regions for the Lasso by Using Stochastic Variational Inequality Techniques in Optimization