A smooth approximation approach for optimization with probabilistic constraints based on sigmoid function
DOI10.1186/S13660-022-02774-4zbMATH Open1506.90183OpenAlexW4226135300MaRDI QIDQ2129136FDOQ2129136
Publication date: 22 April 2022
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-022-02774-4
Recommendations
- A smooth D.C. approximation of probabilistic constrained optimization problems
- Application of the smooth approximation of the probability function in some applied stochastic programming problems
- A log-sigmoid approximation to chance constrained programs
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- A sample average approximation approach for log-sigmoid approximation of chance constrained problem
- Smoothed Functionals and Constrained Stochastic Approximation
- A smoothing function approach to joint chance constrained programs
- Solving chance-constrained problems via a smooth sample-based nonlinear approximation
- Smooth approximation of chance constrained stochastic nonlinear complementarity problems
- A smoothing function approach to joint chance-constrained programs
sigmoid functionsequential convex approximationprobabilistic constrained optimization problemsmooth approximation approach
Convex programming (90C25) Nonlinear programming (90C30) Stochastic programming (90C15) Nonsmooth analysis (49J52)
Cites Work
- Variational Analysis
- Title not available (Why is that?)
- Optimization and nonsmooth analysis
- Robust solutions of linear programming problems contaminated with uncertain data
- Uncertain convex programs: randomized solutions and confidence levels
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- Lectures on Stochastic Programming
- The Scenario Approach to Robust Control Design
- Convex Approximations of Chance Constrained Programs
- Chance Constrained Programming with Joint Constraints
- On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
- Sequential Convex Approximations to Joint Chance Constrained Programs: A Monte Carlo Approach
- A smoothing function approach to joint chance-constrained programs
- Title not available (Why is that?)
- Quantitative stability analysis for distributionally robust optimization with moment constraints
- Quantitative stability analysis of stochastic quasi-variational inequality problems and applications
- Title not available (Why is that?)
- A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems
Cited In (1)
This page was built for publication: A smooth approximation approach for optimization with probabilistic constraints based on sigmoid function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2129136)