An efficient algorithm for a certain class of robust optimization problems

DOI10.1108/COMPEL-11-2012-0320MaRDI QIDQ2970721zbMATH OpenOpenAlexFDO

Authors Meinhard Paffrath, U. Wever

Publication date 30 March 2017

Published in COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1108/compel-11-2012-0320

zbMATH Keywords

optimal designuncertainty estimation3D FEMturbines

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Finite element methods applied to problems in solid mechanics (74S05) Optimization of other properties in solid mechanics (74P10)

Recommendations

• Development of a simple and efficient method for robust optimization
• Note on the effectiveness of stochastic optimization algorithms for robust design
• Robust optimization-methodology and applications
• A polynomial chaos expansion trust region method for robust optimization
• Approximation methods for reliability-based design optimization problems

Cites work

• scientific article; zbMATH DE number 3700586 (Why is no real title available?)
• An efficient algorithm for a certain class of robust optimization problems
• Anti-optimization technique for structural design under load uncertainties
• Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
• Interval analysis: Theory and applications
• Optimization and anti-optimization of structures under uncertainty.
• Polynomial chaos for the approximation of uncertainties: Chances and limits
• Semi-infinite relaxation of joint chance constraints in chance-constrained programming Part 1. Zero-order stochastic decision rules†
• Structural design under bounded uncertainty—Optimization with anti-optimization
• Surfaces Generated by Moving Least Squares Methods
• The Homogeneous Chaos
• The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
• The orthogonal development of non-linear functionals in series of Fourier-Hermite functionals

Cited in

(14)

• A robust algorithm for semidefinite programming
• Note on the effectiveness of stochastic optimization algorithms for robust design
• Running time analysis of the (1+1)-EA for robust linear optimization
• scientific article; zbMATH DE number 6321164 (Why is no real title available?)
• Robust optimization with quantile measures on global metamodels
• A dynamic programming approach for a class of robust optimization problems
• A polynomial chaos expansion trust region method for robust optimization
• An efficient algorithm for a certain class of robust optimization problems
• Robust Solutions to a General Class of Approximation Problems
• Essential intersection and approximation results for robust optimization
• Development of a simple and efficient method for robust optimization
• Optimal algorithms theory for robust estimation and prediction
• scientific article; zbMATH DE number 6843801 (Why is no real title available?)
• Complexity and in-approximability of a selection problem in robust optimization

Describes a project that uses

Uses Software

• NLPQL

This page was built for publication: An efficient algorithm for a certain class of robust optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2970721)