Nonconvex robust optimization for problems with constraints
From MaRDI portal
Recommendations
Cited in
(33)- A robust approach to warped Gaussian process-constrained optimization
- Data-driven robust resource allocation with monotonic cost functions
- Automatic generation of algorithms for robust optimisation problems using grammar-guided genetic programming
- An Approximation Scheme for Distributionally Robust Nonlinear Optimization
- Surrogate-based robust design for a non-smooth radiation source detection problem
- Robust feasibility of systems of quadratic equations using topological degree theory
- Reducing Conservatism in Robust Optimization
- Outer approximation for generalized convex mixed-integer nonlinear robust optimization problems
- Derivative-free robust optimization for circuit design
- On robustness in nonconvex optimization with application to defense planning
- Robust simulation-based optimization for multiobjective problems with constraints
- A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty
- Robust nonlinear optimization with conic representable uncertainty set
- Nonconvex robust programming via value-function optimization
- Robust randomized optimization with k nearest neighbors
- Recent advances in robust optimization: an overview
- Interval uncertainty-based robust optimization for convex and non-convex quadratic programs with applications in network infrastructure planning
- A hybrid approach to beam angle optimization in intensity-modulated radiation therapy
- Decision uncertainty in multiobjective optimization
- HEBO: An Empirical Study of Assumptions in Bayesian Optimisation
- Robust Maximum Likelihood Estimation
- An interval branch and bound method for global robust optimization
- Particle swarm metaheuristics for robust optimisation with implementation uncertainty
- Robust optimization with simulated annealing
- Uncertain data envelopment analysis
- SDP reformulation for robust optimization problems based on nonconvex QP duality
- Real-Time Radiation Treatment Planning with Optimality Guarantees via Cluster and Bound Methods
- A unified robust optimization approach for problems with costly simulation-based objectives and constraints
- Robust optimization for unconstrained simulation-based problems
- Robust Direct Aperture Optimization for Radiation Therapy Treatment Planning
- Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates
- Expected improvement based infill sampling for global robust optimization of constrained problems
- Relaxing high-dimensional constraints in the direct solution space method for early phase development
This page was built for publication: Nonconvex robust optimization for problems with constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2899036)
