A randomized cutting plane method with probabilistic geometric convergence
From MaRDI portal
Publication:3083327
Recommendations
- Randomized interior point methods for sampling and optimization
- A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
- scientific article; zbMATH DE number 1775049
- A Randomized Algorithm to Optimize Over Certain Convex Sets
- A cutting plane algorithm for convex programming that uses analytic centers
Cited in
(13)- Why does Monte Carlo fail to work properly in high-dimensional optimization problems?
- Solving convex programs by random walks
- A practical algorithm for volume estimation based on billiard trajectories and simulated annealing
- A Randomized Algorithm to Optimize Over Certain Convex Sets
- Truncated log-concave sampling for convex bodies with reflective Hamiltonian Monte Carlo
- Efficient sampling in spectrahedra and volume approximation
- Randomized methods based on new Monte Carlo schemes for control and optimization
- Optimization with a class of multivariate integral stochastic order constraints
- A stochastic subspace approach to gradient-free optimization in high dimensions
- Random sampling: billiard walk algorithm
- Research on probabilistic methods for control system design
- Randomized methods for design of uncertain systems: sample complexity and sequential algorithms
- A flexible elicitation procedure for additive model scale constants
This page was built for publication: A randomized cutting plane method with probabilistic geometric convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083327)
