A nonmonotone spectral projected gradient method for large-scale topology optimization problems

DOI10.3934/NACO.2012.2.395zbMATH Open1247.90191arXiv1006.0561OpenAlexW2963670458MaRDI QIDQ450758FDOQ450758

Authors: Rouhollah Tavakoli, Hongchao Zhang 

Publication date: 14 September 2012

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Abstract: An efficient gradient-based method to solve the volume constrained topology optimization problems is presented. Each iterate of this algorithm is obtained by the projection of a Barzilai-Borwein step onto the feasible set consisting of box and one linear constraints (volume constraint). To ensure the global convergence, an adaptive nonmonotone line search is performed along the direction that is given by the current and projection point. The adaptive cyclic reuse of the Barzilai-Borwein step is applied as the initial stepsize. The minimum memory requirement, the guaranteed convergence property, and almost only one function and gradient evaluations per iteration make this new method very attractive within common alternative methods to solve large-scale optimal design problems. Efficiency and feasibility of the presented method are supported by numerical experiments.

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

Recommendations

• Inertial projected gradient method for large-scale topology optimization
• Accelerated projected gradient method with adaptive step size for compliance minimization problem
• A new nonmonotone spectral projected gradient method for bound constrained optimization
• A new spectral gradient method for unconstrained optimization
• A modified gradient projection method for static and dynamic topology optimization

zbMATH Keywords

volume constraintnonmonotone line searchBarzilai-Borwein step-sizedistributed parameter identificationlarge-scale topology optimizationmethod of moving asymptotic (MMA)

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26)

Cited In (16)

• A dual spectral projected gradient method for log-determinant semidefinite problems
• An extension of the projected gradient method to a Banach space setting with application in structural topology optimization
• An adaptive method of moving asymptotes for topology optimization based on the trust region
• Nonmonotone line search methods with variable sample size
• Spectral decomposition for graded multi-scale topology optimization
• Optimal design of multiphase composites under elastodynamic loading
• An efficient optimization approach for a cardinality-constrained index tracking problem
• On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex
• On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients
• Computationally efficient approach for the minimization of volume constrained vector-valued Ginzburg-Landau energy functional
• Accelerated projected gradient method with adaptive step size for compliance minimization problem
• A modified gradient projection method for static and dynamic topology optimization
• Optimal control of viscous Burgers equation via an adaptive nonmonotone Barzilai-Borwein gradient method
• Multimaterial topology optimization by volume constrained Allen-Cahn system and regularized projected steepest descent method
• On equivalence between optimality criteria and projected gradient methods with application to topology optimization problem
• Inertial projected gradient method for large-scale topology optimization

Uses Software

• CONLIN

This page was built for publication: A nonmonotone spectral projected gradient method for large-scale topology optimization problems

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