Shape identification via metrics constructed from the oriented distance function
Michel Delfour, Jean-Paul Zolésio (2005)
Control and Cybernetics
Similarity:
Displaying similar documents to “Radial basis function level set method for structural optimization”
Shape identification via metrics constructed from the oriented distance function
Mathematical challenges in shape optimization
A. Henrot, J. Sokołowski (2005)
Control and Cybernetics
Similarity:
Fast level set based algorithms using shape and topological sensitivity information
M. Hinterműller (2005)
Control and Cybernetics
Similarity:
Adaptive Newton-like method for shape optimization
Jean Roche (2005)
Control and Cybernetics
Similarity:
A numerical solution of diffraction problems for the radiation transport equation.
Prokhorov, I.V., Yarovenko, I.P. (2005)
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Similarity:
Strong average optimality criterion for continuous-time Markov decision processes
Qingda Wei, Xian Chen (2014)
Kybernetika
Similarity:
This paper deals with continuous-time Markov decision processes with the unbounded transition rates under the strong average cost criterion. The state and action spaces are Borel spaces, and the costs are allowed to be unbounded from above and from below. Under mild conditions, we first prove that the finite-horizon optimal value function is a solution to the optimality equation for the case of uncountable state spaces and unbounded transition rates, and that there exists an optimal...
Chance constrained problems: penalty reformulation and performance of sample approximation technique
Martin Branda (2012)
Kybernetika
Similarity:
We explore reformulation of nonlinear stochastic programs with several joint chance constraints by stochastic programs with suitably chosen penalty-type objectives. We show that the two problems are asymptotically equivalent. Simpler cases with one chance constraint and particular penalty functions were studied in [6,11]. The obtained problems with penalties and with a fixed set of feasible solutions are simpler to solve and analyze then the chance constrained programs. We discuss solving...