891 |
Sattelpunkte und Optimalitätsbedingungen bei restringierten OptimierungsproblemenGrunert, Sandro 10 June 2009 (has links) (PDF)
Sattelpunkte und Optimalitätsbedingungen bei restringierten Optimierungsproblemen
Ausarbeitung im Rahmen des Seminars "Optimierung", WS 2008/2009
Die Dualitätstheorie für restringierte Optimierungsaufgaben findet in der Spieltheorie und in der Ökonomik eine
interessante Anwendung. Mit Hilfe von Sattelpunkteigenschaften werden diverse Interpretationsmöglichkeiten der
Lagrange-Dualität vorgestellt. Anschließend gilt das Augenmerk den Optimalitätsbedingungen solcher Probleme.
Grundlage für die Ausarbeitung ist das Buch "Convex Optimization" von Stephen Boyd und Lieven Vandenberghe.
|
892 |
Complexity and Approximation of the Rectilinear Steiner Tree ProblemMussafi, Noor Saif Muhammad 05 August 2009 (has links)
Given a finite set K of terminals in the plane. A
rectilinear Steiner minimum tree for K (RST) is
a tree which interconnects among these terminals
using only horizontal and vertical lines of shortest
possible length containing Steiner point. We show the
complexity of RST i.e. belongs to NP-complete.
Moreover we present an approximative method of
determining the solution of RST problem proposed by Sanjeev Arora
in 1996, Arora's Approximation Scheme. This algorithm
has time complexity polynomial in the number of
terminals for a fixed performance ratio 1 + Epsilon.
|
893 |
Bifurcations of one dimensional stochastic differential equations /Steinkamp, Marcus. January 1900 (has links)
Diss.--Mathematik--Berlin--Humboldt-Universität, 2000. / Notes bibliogr. Bibliogr. p. [175]-179. Index.
|
894 |
On the solution of the radical matrix equation $X=Q+LX^{-1}L^T$Benner, Peter, Faßbender, Heike 26 November 2007 (has links) (PDF)
We study numerical methods for finding the maximal
symmetric positive definite solution of the nonlinear matrix equation
$X = Q + LX^{-1}L^T$, where Q is symmetric positive definite and L is
nonsingular. Such equations arise for instance in the analysis of
stationary Gaussian reciprocal processes over a finite interval.
Its unique largest positive definite solution coincides with the unique
positive definite solution of a related discrete-time algebraic
Riccati equation (DARE). We discuss how to use the butterfly
SZ algorithm to solve the DARE. This approach is compared to
several fixed point type iterative methods suggested in the
literature.
|
895 |
Drinfeld-Moduln und elliptische Garben / Drinfeld modules and elliptic sheavesWiedmann, Stefan 28 October 2004 (has links)
No description available.
|
896 |
Almost sure behavior for increments of U-statistics / Beschreibung der Fluktuation von Zuwächsen für U-StatistikenAbujarad, Mohammed 18 January 2007 (has links)
No description available.
|
897 |
Charakterisierung eines Gebiets durch Spektraldaten eines Dirichletproblems zur Stokesgleichnung / Characterisation of domains by spectral data of a Dirichlet problem for the Stokes equationTsiporin, Viktor 20 January 2004 (has links)
No description available.
|
898 |
Algorithmen zur Kopplung und Interpolation in der Aerelastik / Algorithms for Coupling and Interpolation in the AeroelasticAhrem, Regine 19 December 2005 (has links)
No description available.
|
899 |
The Capitulation Problem in Class Field Theory / Das Kapitulationsproblem in der KlassenkörpertheorieBembom, Tobias 02 April 2012 (has links)
No description available.
|
900 |
Transforming Instruction and Assessment Using Student-created VideoKeen, Virginia 16 March 2012 (has links) (PDF)
No description available.
|
Page generated in 0.107 seconds