A subgradient method for free material design
From MaRDI portal
complexityconstrained least squaresdualityfast gradient methodfirst-order methodfree material optimizationLagrangianlarge-scale problemsNesterov's primal-dual subgradient methodsaddle-point
Computational methods for problems pertaining to operations research and mathematical programming (90-08) Large-scale problems in mathematical programming (90C06) Convex programming (90C25) Nonlinear programming (90C30) Minimax problems in mathematical programming (90C47) Applications of mathematical programming (90C90)
Abstract: A small improvement in the structure of the material could save the manufactory a lot of money. The free material design can be formulated as an optimization problem. However, due to its large scale, second-order methods cannot solve the free material design problem in reasonable size. We formulate the free material optimization (FMO) problem into a saddle-point form in which the inverse of the stiffness matrix A(E) in the constraint is eliminated. The size of A(E) is generally large, denoted as N by N. This is the first formulation of FMO without A(E). We apply the primal-dual subgradient method [17] to solve the restricted saddle-point formula. This is the first gradient-type method for FMO. Each iteration of our algorithm takes a total of foating-point operations and an auxiliary vector storage of size O(N), compared with formulations having the inverse of A(E) which requires arithmetic operations and an auxiliary vector storage of size . To solve the problem, we developed a closed-form solution to a semidefinite least squares problem and an efficient parameter update scheme for the gradient method, which are included in the appendix. We also approximate a solution to the bounded Lagrangian dual problem. The problem is decomposed into small problems each only having an unknown of k by k (k = 3 or 6) matrix, and can be solved in parallel. The iteration bound of our algorithm is optimal for general subgradient scheme. Finally we present promising numerical results.
Recommendations
Cites work
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A primal-dual interior point method for large-scale free material optimization
- A sequential convex semidefinite programming algorithm with an application to multiple-load free material optimization
- An Analytical Model to Predict Optimal Material Properties in the Context of Optimal Structural Design
- Barrier subgradient method
- Dual extrapolation and its applications to solving variational inequalities and related problems
- First-order methods of smooth convex optimization with inexact oracle
- Free Material Design via Semidefinite Programming: The Multiload Case with Contact Conditions
- Free material optimization via mathematical programming
- Free Material Optimization with Fundamental Eigenfrequency Constraints
- Free material optimization: recent progress†
- Gradient methods and conic least-squares problems
- Gradient methods for minimizing composite functions
- scientific article; zbMATH DE number 3148887 (Why is no real title available?)
- scientific article; zbMATH DE number 1376935 (Why is no real title available?)
- Multidisciplinary free material optimization
- Primal-dual subgradient methods for convex problems
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Smooth minimization of non-smooth functions
- The variation of the spectrum of a normal matrix
- Universal gradient methods for convex optimization problems
Cited in
(2)
This page was built for publication: A subgradient method for free material design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2832891)
