Primal-Dual Interior Point Multigrid Method for Topology Optimization

DOI10.1137/15M1044126zbMath1348.65093arXiv1606.06201OpenAlexW2963498255MaRDI QIDQ2818251

Michal Kočvara, Sudaba Mohammed

Publication date: 7 September 2016

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.06201

zbMATH Keywords

algorithmconjugate gradient methodmultigrid methodsinterior point methodstopology optimizationlarge scale problemspreconditioners for iterative methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Interior-point methods (90C51) Preconditioners for iterative methods (65F08) PDEs in connection with control and optimization (35Q93)

Related Items

Topology optimization of freely floating elastic continua using the inertia relief method, The dual approach to optimal control in the coefficients of nonlocal nonlinear diffusion, A modified leaky ReLU scheme (MLRS) for topology optimization with multiple materials, On Barrier and Modified Barrier Multigrid Methods for Three-Dimensional Topology Optimization

Uses Software

• SNOPT
• CHOLMOD
• PENSDP
• top.m
• top88.m
• GPUTop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Efficient topology optimization in MATLAB using 88 lines of code
• On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
• On the convergence of multi-grid methods with transforming smoothers
• Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation.
• A 2589 line topology optimization code written for the graphics card
• Hidden convexity in some nonconvex quadratically constrained quadratic programming
• Filters in topology optimization
• A Class of Globally Convergent Optimization Methods Based on Conservative Convex Separable Approximations
• Convergence Analysis of an Inexact Feasible Interior Point Method for Convex Quadratic Programming
• Constraint Interface Preconditioning for Topology Optimization Problems
• Large-scale topology optimization using preconditioned Krylov subspace methods with recycling
• Inexact Newton Methods
• Optimal Truss Design by Interior-Point Methods
• Trust Region Methods
• A Multigrid Tutorial, Second Edition
• Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization