A linearly constrained algorithm not requiring derivative continuity: Fid-Bau Portal

Fachinformationsdienst BAUdigital

A platform for research: civil engineering, architecture and urbanism

A linearly constrained algorithm not requiring derivative continuity

Hien Nguyen, V. / Strodiot, J.-J.

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.

Access

Check availability in my library

Order at Subito €

Page navigation

Document information

Export, share and cite

A linearly constrained algorithm not requiring derivative continuity

Hien Nguyen, V. / Strodiot, J.-J.

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. / Strodiot, J.-J.

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.

Access

Check availability in my library

Order at Subito €

Page navigation

Document information

Export, share and cite

Document information

Title:

A linearly constrained algorithm not requiring derivative continuity

Contributors:

Hien Nguyen, V. (author) / Strodiot, J.-J. (author)

Published in:

Engineering Structures ; 6 ; 7-11

Publication date:

1984-01-01

Size:

5 pages

ISSN:

DOI:

https://doi.org/10.1016/0141-0296(84)90056-7

Type of media:

Article (Journal)

Type of material:

Electronic Resource

Language:

English

Keywords:

mathematical programming , non-differentiable optimization , dual methods , numerical methods , optimum structural design , large engineering systems

Similar titles

Portfolio construction as linearly constrained separable optimization

Moehle, Nicholas / Gindi, Jack / Boyd, Stephen et al. | Springer Verlag | 2023

An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization

Fathi-Hafshejani, S. / Moaberfard, Z. | Springer Verlag | 2020

Job requiring permits!!!

Online Contents | 2005

A New Fast Algorithm for Linearly Unmixing Hyperspectral Images

Raul Guerra | Online Contents | 2015

Linearly constrained minimum variance spatial filtering for localization of conductivity changes in electrical impedance tomography

Fernandez-Corazza, M. / von Ellenrieder, N. / Muravchik, C.H. | British Library Online Contents | 2015