Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems
From MaRDI portal
Publication:2010090
Recommendations
- Global probability maximization for a Gaussian bilateral inequality in polynomial time
- Convexity of Gaussian chance constraints and of related probability maximization problems
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- Uncertain convex programs: randomized solutions and confidence levels
- Generalized Gauss inequalities via semidefinite programming
Cites work
- scientific article; zbMATH DE number 995813 (Why is no real title available?)
- scientific article; zbMATH DE number 53598 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- A comparison of complete global optimization solvers
- A convex envelope formula for multilinear functions
- A model for dynamic chance constraints in hydro power reservoir management
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- A second-order cone programming approach for linear programs with joint probabilistic constraints
- An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes
- An integer programming and decomposition approach to general chance-constrained mathematical programs
- An integer programming approach for linear programs with probabilistic constraints
- Applications of second-order cone programming
- Chance Constrained Programming with Joint Constraints
- Chance-Constrained Programming with Joint Constraints
- Chance-constrained optimal power flow: risk-aware network control under uncertainty
- Chance-constrained programming
- Coal blending optimization under uncertainty
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Convexity and optimization with copulæ structured probabilistic constraints
- Convexity of Chance Constraints with Dependent Random Variables: The Use of Copulae
- Convexity of Gaussian chance constraints and of related probability maximization problems
- Convexity of chance constraints with independent random variables
- Decomposition algorithms for two-stage chance-constrained programs
- Deterministic global optimization. Theory, methods and applications
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- Geometric algorithms and combinatorial optimization
- Global probability maximization for a Gaussian bilateral inequality in polynomial time
- On joint probabilistic constraints with Gaussian coefficient matrix
- On mixing sets arising in chance-constrained programming
- Probabilistic constraints via SQP solver: application to a renewable energy management problem
- Semidefinite relaxations of fractional programs via novel convexification techniques
- Simple linkage: Analysis of a threshold-accepting global optimization method
- Stochastic optimization for blending problem in brass casting industry
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
Cited in
(2)
This page was built for publication: Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010090)
