Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach
DOI10.1007/s10589-018-0013-3zbMath1409.90134arXiv1711.02351OpenAlexW2784166150MaRDI QIDQ1616936
Publication date: 7 November 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.02351
semidefinite programmingrobust optimizationconcave-convex proceduredesign-dependent loadcomplementarity constraintdifference-of-convex programming
Semidefinite programming (90C22) Minimax problems in mathematical programming (90C47) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- Optimization under uncertainty with applications to design of truss structures
- Global optimization of robust truss topology via mixed integer semidefinite programming
- A note on the min-max formulation of stiffness optimization including non-zero prescribed displacements
- Minmax topology optimization
- On solving linear complementarity problems by DC programming and DCA
- A majorization-minimization approach to the sparse generalized eigenvalue problem
- A new decomposition algorithm for globally solving mathematical programs with affine equilibrium constraints
- Handbook on semidefinite, conic and polynomial optimization
- Topology optimization for worst load conditions based on the eigenvalue analysis of an aggregated linear system
- Confidence structural robust design and optimization under stiffness and load uncertainties
- Principal compliance and robust optimal design
- Sequential semidefinite program for maximum robustness design of structures under load uncertainty
- A sequential parametric convex approximation method with applications to nonconvex truss topology design problems
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC formulations and algorithms for sparse optimization problems
- A study of the difference-of-convex approach for solving linear programs with complementarity constraints
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Variations and extension of the convex-concave procedure
- Variable selection using MM algorithms
- Transactions on Computational Collective Intelligence XIII
- A Class of Globally Convergent Optimization Methods Based on Conservative Convex Separable Approximations
- Confidence structural robust optimization by non-linear semidefinite programming-based single-level formulation
- Graph Implementations for Nonsmooth Convex Programs
- A mixed integer programming for robust truss topology optimization with stress constraints
- Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints
- The method of moving asymptotes—a new method for structural optimization
- Equivalent displacement based formulations for maximum strength truss topology design
- Optimal Truss Design by Interior-Point Methods
- Robust Truss Topology Design via Semidefinite Programming
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- The Concave-Convex Procedure
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
- A Brief Survey of Modern Optimization for Statisticians
- Shape and topology optimization of the robust complianceviathe level set method
- 10.1162/153244303765208403
- Combined SVM-based feature selection and classification
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Global convergence of a nonlinear programming method using convex approximations
- Optimal design of trusses under a nonconvex global buckling constraint
This page was built for publication: Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach