Displaying similar documents to “Mathematical challenges in shape optimization”

Sliding subspace design based on linear matrix inequalities

Alán Tapia, Raymundo Márquez, Miguel Bernal, Joaquín Cortez (2014)

Kybernetika

Similarity:

In this work, an alternative for sliding surface design based on linear and bilinear matrix inequalities is proposed. The methodology applies for reduced and integral sliding mode control, both continuous- and discrete-time; it takes advantage of the Finsler's lemma to provide a greater degree of freedom than existing approaches for sliding subspace design. The sliding surfaces thus constructed are systematically found via convex optimization techniques, which are efficiently implemented...

Efficient application of e-invariants in finite element method for an elastodynamic equation

Martin Balazovjech, Ladislav Halada (2013)

Kybernetika

Similarity:

We introduce a new efficient way of computation of partial differential equations using a hybrid method composed from FEM in space and FDM in time domain. The overall computational scheme is explicit in time. The key idea of the suggested way is based on a transformation of standard basis functions into new basis functions. The results of this matrix transformation are e-invariants (effective invariants) with such suitable properties which save the number of arithmetical operations needed...

Computing minimum norm solution of a specific constrained convex nonlinear problem

Saeed Ketabchi, Hossein Moosaei (2012)

Kybernetika

Similarity:

The characterization of the solution set of a convex constrained problem is a well-known attempt. In this paper, we focus on the minimum norm solution of a specific constrained convex nonlinear problem and reformulate this problem as an unconstrained minimization problem by using the alternative theorem.The objective function of this problem is piecewise quadratic, convex, and once differentiable. To minimize this function, we will provide a new Newton-type method with global convergence...