Relaxing high-dimensional constraints in the direct solution space method for early phase development
From MaRDI portal
Publication:2315082
DOI10.1007/S11081-018-9381-XzbMath1423.90161OpenAlexW2790318054WikidataQ130069629 ScholiaQ130069629MaRDI QIDQ2315082
Johannes Fender, Volker A. Lange, Fabian M. E. Duddeck
Publication date: 31 July 2019
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-018-9381-x
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Infeasible interior-point methods for linear optimization based on large neighborhood
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
- An uncertainty management framework for industrial applications
- Nonconvex Robust Optimization for Problems with Constraints
- Theory and Applications of Robust Optimization
- Convex Approximations of Chance Constrained Programs
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
This page was built for publication: Relaxing high-dimensional constraints in the direct solution space method for early phase development