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 $O(N^2)$ foating-point operations and an auxiliary vector storage of size O(N), compared with formulations having the inverse of A(E) which requires $O(N^3)$ arithmetic operations and an auxiliary vector storage of size $O(N^2)$. 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.
An Approximate Conjugate Subgradient Algorithm with Matrix Parameter for Derivative-Free Nonsmooth Optimization Problems
Fakultät für Mathematik, Universität Wien(维也纳大学);Faculty of Engineering, Free University of Bozen–Bolzano(博岑-博尔扎诺自由大学);Université Catholique de Louvain (UCLouvain)(天主教鲁汶大学)
Universal subgradient and proximal bundle methods for convex and strongly convex hybrid composite optimization
FGV/EMAp(巴西圣保罗基金会应用数学学院);Goergen Institute for Data Science and Artificial Intelligence (GIDS-AI) and Department of Computer Science, University of Rochester(罗切斯特大学戈根数据科学与人工智能研究所及计算机系);School of Industrial and Systems Engineering, Georgia Institute of Technology(佐治亚理工学院工业与系统工程学院)
Parameter-Free Online Convex Optimization with Sub-Exponential Noise
Boston University(波士顿大学)
考虑了带次指数噪声的无约束在线凸优化问题,这是一个比标准的在线凸优化更一般的问题。在这种设置中,学习器接收被次指数噪声破坏的损失函数的次梯度,并努力实现最佳后悔保证,而不知道竞争者范数,即,in a parameter-free参数of way.最近,Cutkosky和Boahen(COLT 2017)证明,给定无界次梯度,由于指数惩罚,不可能保证次线性后悔。本文表明,它是可能的去周围的下限,允许所观察到的次梯度是无界通过随机噪声。然而,在无约束OCO中存在无界噪声是具有挑战性的,现有的算法不提供接近最优的遗憾界限或不能保证。因此,我们设计了一个新的参数自由OCO算法的Banach空间,我们称之为BANCO,通过减少对噪声硬币的投注。我们表明,BANCO实现了最佳的遗憾率在我们的问题。最后,我们展示了我们的结果的应用,以获得一个无参数的局部私有随机次梯度下降算法,并连接到法律的迭代算法。
An Adaptive Parameter-free and Projection-free Restarting Level Set Method for Constrained Convex Optimization Under the Error Bound Condition
The University of Iowa, Tippie College of Business(爱荷华大学蒂皮商学院);University of Illinois at Chicago, College of Business Administration(伊利诺伊大学芝加哥分校工商管理学院)
Overlap-free multi-material topology optimization for minimum compliance in two and three dimensions by level-set-based negative-mapping interpolation
School of Mechanical Engineering, Southwest Jiaotong University(西南交通大学机械工程学院);Technology and Equipment of Rail Transit Operation and Maintenance Key Laboratory of Sichuan Province, Southwest Jiaotong University(四川省轨道交通运营维护关键技术实验室,西南交通大学);State Key Laboratory of Bridge Intelligent and Green Construction, Southwest Jiaotong University(西南交通大学桥梁智能绿色建造全国重点实验室);School of Mechanical Engineering, University of Leeds(利兹大学机械工程学院)