Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems
From MaRDI portal
Publication:2010090
DOI10.1007/S10898-019-00756-3zbMATH Open1433.90094OpenAlexW2920957089MaRDI QIDQ2010090FDOQ2010090
Authors: Riadh Zorgati, Michel Minoux 
Publication date: 3 December 2019
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-019-00756-3
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
global optimizationconcave envelopesjoint probability maximizationFenchel transformrandom Gaussian inequalities
Cites Work
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization
- Chance-constrained programming
- Title not available (Why is that?)
- Applications of second-order cone programming
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- Semidefinite relaxations of fractional programs via novel convexification techniques
- Deterministic global optimization. Theory, methods and applications
- On mixing sets arising in chance-constrained programming
- Chance Constrained Programming with Joint Constraints
- A convex envelope formula for multilinear functions
- A comparison of complete global optimization solvers
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Decomposition algorithms for two-stage chance-constrained programs
- Title not available (Why is that?)
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- An integer programming approach for linear programs with probabilistic constraints
- A model for dynamic chance constraints in hydro power reservoir management
- Convexity of chance constraints with independent random variables
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- Chance-constrained optimal power flow: risk-aware network control under uncertainty
- A second-order cone programming approach for linear programs with joint probabilistic constraints
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes
- Chance-Constrained Programming with Joint Constraints
- An integer programming and decomposition approach to general chance-constrained mathematical programs
- Convexity of Chance Constraints with Dependent Random Variables: The Use of Copulae
- On joint probabilistic constraints with Gaussian coefficient matrix
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- Coal blending optimization under uncertainty
- Stochastic optimization for blending problem in brass casting industry
- Convexity of Gaussian chance constraints and of related probability maximization problems
- Global probability maximization for a Gaussian bilateral inequality in polynomial time
- Probabilistic constraints via SQP solver: application to a renewable energy management problem
- Convexity and optimization with copulæ structured probabilistic constraints
- Simple linkage: Analysis of a threshold-accepting global optimization method
Cited In (2)
Uses Software
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)
