Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
A linearly constrained algorithm not requiring derivative continuity
Abstract Many problems of mathematical programming, particularly the structural design optimization problem with discrete variables, pose the task of minimizing, under constraints, a non-differentiable function of several variables. In some cases that task is inherent in the problem. In other cases setting such a task is just one of several ways of formulating the problem. This paper describes a new feasible descent method for finding epsilon-solutions of non-differentiable convex optimization problems under general linear constraints.
A linearly constrained algorithm not requiring derivative continuity
Abstract Many problems of mathematical programming, particularly the structural design optimization problem with discrete variables, pose the task of minimizing, under constraints, a non-differentiable function of several variables. In some cases that task is inherent in the problem. In other cases setting such a task is just one of several ways of formulating the problem. This paper describes a new feasible descent method for finding epsilon-solutions of non-differentiable convex optimization problems under general linear constraints.
A linearly constrained algorithm not requiring derivative continuity
Hien Nguyen, V. (Autor:in) / Strodiot, J.-J. (Autor:in)
Engineering Structures ; 6 ; 7-11
01.01.1984
5 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Portfolio construction as linearly constrained separable optimization
| Springer Verlag | 2023
Online Contents | 2005
A New Fast Algorithm for Linearly Unmixing Hyperspectral Images
| Online Contents | 2015
| British Library Online Contents | 2015