To see the other types of publications on this topic, follow the link: Convex Function and Duality.

Dissertations / Theses on the topic 'Convex Function and Duality'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Convex Function and Duality.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Vargyas, Emese Tünde. "Duality for convex composed programming problems." Doctoral thesis, Universitätsbibliothek Chemnitz, 2004. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200401793.

Full text
Abstract:
The goal of this work is to present a conjugate duality treatment of composed programming as well as to give an overview of some recent developments in both scalar and multiobjective optimization. In order to do this, first we study a single-objective optimization problem, in which the objective function as well as the constraints are given by composed functions. By means of the conjugacy approach based on the perturbation theory, we provide different kinds of dual problems to it and examine the relations between the optimal objective values of the duals. Given some additional assumptions, we
APA, Harvard, Vancouver, ISO, and other styles
2

Hodrea, Ioan Bogdan. "Farkas - type results for convex and non - convex inequality systems." Doctoral thesis, [S.l. : s.n.], 2008. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-200800075.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

White, Edward C. Jr. "Polar - legendre duality in convex geometry and geometric flows." Thesis, Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/24689.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lorenz, Nicole. "Application of the Duality Theory." Doctoral thesis, Universitätsbibliothek Chemnitz, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-94108.

Full text
Abstract:
The aim of this thesis is to present new results concerning duality in scalar optimization. We show how the theory can be applied to optimization problems arising in the theory of risk measures, portfolio optimization and machine learning. First we give some notations and preliminaries we need within the thesis. After that we recall how the well-known Lagrange dual problem can be derived by using the general perturbation theory and give some generalized interior point regularity conditions used in the literature. Using these facts we consider some special scalar optimization problems having a
APA, Harvard, Vancouver, ISO, and other styles
5

Bot, Radu Ioan. "Duality and optimality in multiobjective optimization." Doctoral thesis, Universitätsbibliothek Chemnitz, 2003. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200300842.

Full text
Abstract:
The aim of this work is to make some investigations concerning duality for multiobjective optimization problems. In order to do this we study first the duality for scalar optimization problems by using the conjugacy approach. This allows us to attach three different dual problems to a primal one. We examine the relations between the optimal objective values of the duals and verify, under some appropriate assumptions, the existence of strong duality. Closely related to the strong duality we derive the optimality conditions for each of these three duals. By means of these considerations, we stud
APA, Harvard, Vancouver, ISO, and other styles
6

Boţ, Radu Ioan. "Conjugate duality in convex optimization." Berlin [u.a.] Springer, 2010. http://dx.doi.org/10.1007/978-3-642-04900-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Tünde, Vargyas Emese. "Duality for convex composed programming problems." [S.l. : s.n.], 2004. http://archiv.tu-chemnitz.de/pub/2004/0179.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

ROCCO, Marco. "Maximal Monotone Operators, Convex Representations and Duality." Doctoral thesis, Università degli studi di Bergamo, 2011. http://hdl.handle.net/10446/869.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Tsoutsinos, George. "Convex duality in control problems with time-delays." Thesis, Imperial College London, 1990. http://hdl.handle.net/10044/1/46587.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kim, Jaegil. "Duality phenomena and Volume inequalities in Convex Geometry." Kent State University / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=kent1368188809.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Botelho, Fabio Silva. "Variational Convex Analysis." Diss., Virginia Tech, 2009. http://hdl.handle.net/10919/28351.

Full text
Abstract:
This work develops theoretical and applied results for variational convex analysis. First we present the basic tools of analysis necessary to develop the core theory and applications. New results concerning duality principles for systems originally modeled by non-linear differential equations are shown in chapters 9 to 17. A key aspect of this work is that although the original problems are non-linear with corresponding non-convex variational formulations, the dual formulations obtained are almost always concave and amenable to numerical computations. When the primal problem has no solution in
APA, Harvard, Vancouver, ISO, and other styles
12

Grad, Sorin Mihai. "New insights into conjugate duality." Doctoral thesis, Universitätsbibliothek Chemnitz, 2006. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200601100.

Full text
Abstract:
With this thesis we bring some new results and improve some existing ones in conjugate duality and some of the areas it is applied in. First we recall the way Lagrange, Fenchel and Fenchel - Lagrange dual problems to a given primal optimization problem can be obtained via perturbations and we present some connections between them. For the Fenchel - Lagrange dual problem we prove strong duality under more general conditions than known so far, while for the Fenchel duality we show that the convexity assumptions on the functions involved can be weakened without altering the conclusion. In order
APA, Harvard, Vancouver, ISO, and other styles
13

Mordhorst, Olaf [Verfasser]. "Affine Structures of Convex Bodies and Duality Aspects / Olaf Mordhorst." Kiel : Universitätsbibliothek Kiel, 2017. http://d-nb.info/1124841083/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Tchamga, Nicole Flaure Kouemo. "Portfolio optimization problems : a martingale and a convex duality approach." Thesis, Stellenbosch : University of Stellenbosch, 2010. http://hdl.handle.net/10019.1/5259.

Full text
Abstract:
Thesis (MSc (Mathematics))--University of Stellenbosch, 2010.<br>ENGLISH ABSTRACT: The first approach initiated by Merton [Mer69, Mer71] to solve utility maximization portfolio problems in continuous time is based on stochastic control theory. The idea of Merton was to interpret the maximization portfolio problem as a stochastic control problem where the trading strategies are considered as a control process and the portfolio wealth as the controlled process. Merton derived the Hamilton-Jacobi-Bellman (HJB) equation and for the special case of power, logarithm and exponential utility fun
APA, Harvard, Vancouver, ISO, and other styles
15

Niyobuhungiro, Japhet. "Optimal Decomposition in Real Interpolation and Duality in Convex Analysis." Licentiate thesis, Linköpings universitet, Matematik och tillämpad matematik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-94506.

Full text
Abstract:
This thesis is devoted to the study of mathematical properties of exact minimizers for the K–,L–, and E– functionals of the theory of real interpolation. Recently exact minimizers for these functionals have appeared in important results in image processing. In the thesis, we present a geometry of optimal decomposition for L– functional for the couple (ℓ2, X), where space ℓ2 is defined by the standard Euclidean norm ǁ · ǁ2 and where X is a Banach space on Rn. The well known ROF denoising model is a special case of an L– functional for the couple (L2, BV) where L2 and BV stand for the space of s
APA, Harvard, Vancouver, ISO, and other styles
16

DOLDI, ALESSANDRO. "EQUILIBRIUM, SYSTEMIC RISK MEASURES AND OPTIMAL TRANSPORT: A CONVEX DUALITY APPROACH." Doctoral thesis, Università degli Studi di Milano, 2021. http://hdl.handle.net/2434/812668.

Full text
Abstract:
This Thesis focuses on two main topics. Firstly, we introduce and analyze the novel concept of Systemic Optimal Risk Transfer Equilibrium (SORTE), and we progressively generalize it (i) to a multivariate setup and (ii) to a dynamic (conditional) setting. Additionally we investigate its relation to a recently introduced concept of Systemic Risk Measures (SRM). We present Conditional Systemic Risk Measures and study their properties, dual representation and possible interpretations of the associated allocations as equilibria in the sense of SORTE. On a parallel line of work, we develop a duality
APA, Harvard, Vancouver, ISO, and other styles
17

Hare, David Edwin George. "A duality theory for Banach spaces with the Convex Point-of-Continuity Property." Thesis, University of British Columbia, 1987. http://hdl.handle.net/2429/27313.

Full text
Abstract:
A norm ||⋅|| on a Banach space X is Fréchet differentiable at x ∈ X if there is a functional ∫∈ X* such that [Formula Omitted] This concept reflects the smoothness characteristics of X. A dual Banach space X* has the Radon-Nikodym Property (RNP) if whenever C ⊂ X* is weak*-compact and convex, and ∈ > 0, there is an x ∈ X and an ⍺ > 0 such that diameter [Formula Omitted] this property reflects the convexity characteristics of X*. Culminating several years of work by many researchers, the following theorem established a strong connection between the smoothness of X and the convexity of X*: Eve
APA, Harvard, Vancouver, ISO, and other styles
18

Li, Yusong. "Stochastic maximum principle and dynamic convex duality in continuous-time constrained portfolio optimization." Thesis, Imperial College London, 2016. http://hdl.handle.net/10044/1/45536.

Full text
Abstract:
This thesis seeks to gain further insight into the connection between stochastic optimal control and forward and backward stochastic differential equations and its applications in solving continuous-time constrained portfolio optimization problems. Three topics are studied in this thesis. In the first part of the thesis, we focus on stochastic maximum principle, which seeks to establish the connection between stochastic optimal control and backward stochastic differential differential equations coupled with static optimality condition on the Hamiltonian. We prove a weak neccessary and sufficie
APA, Harvard, Vancouver, ISO, and other styles
19

Yu, Haofeng. "A Numerical Investigation Of The Canonical Duality Method For Non-Convex Variational Problems." Diss., Virginia Tech, 2011. http://hdl.handle.net/10919/29095.

Full text
Abstract:
This thesis represents a theoretical and numerical investigation of the canonical duality theory, which has been recently proposed as an alternative to the classic and direct methods for non-convex variational problems. These non-convex variational problems arise in a wide range of scientific and engineering applications, such as phase transitions, post-buckling of large deformed beam models, nonlinear field theory, and superconductivity. The numerical discretization of these non-convex variational problems leads to global minimization problems in a finite dimensional space. The primary goa
APA, Harvard, Vancouver, ISO, and other styles
20

Shipman, Barbara Anne. "Convex polytopes and duality in the geometry of the full Kostant-Toda lattice." Diss., The University of Arizona, 1995. http://hdl.handle.net/10150/187199.

Full text
Abstract:
Our study describes the structure of the completely integrable system known as the full Kostant-Toda lattice in terms of the rich geometry of complex generalized flag manifolds and the information encoded in their momentum polytopes. The space in which the system evolves is a Poisson manifold which is essentially the dual of a Borel subalgebra of a Lie algebra, and the symplectic leaves are the coadjoint orbits. We extend the results of Ercolani, Flaschka, and Singer in (4) in which an embedding of an isospectral submanifold of the phase space into the flag manifold is used to study the geomet
APA, Harvard, Vancouver, ISO, and other styles
21

Dür, Mirjam. "A Class of Problems where Dual Bounds Beat Underestimation Bounds." Department of Statistics and Mathematics, WU Vienna University of Economics and Business, 2000. http://epub.wu.ac.at/1468/1/document.pdf.

Full text
Abstract:
We investigate the problem of minimizing a nonconvex function with respect to convex constraints, and we study different techniques to compute a lower bound on the optimal value: The method of using convex envelope functions on one hand, and the method of exploiting nonconvex duality on the other hand. We investigate which technique gives the better bound and develop conditions under which the dual bound is strictly better than the convex envelope bound. As a byproduct, we derive some interesting results on nonconvex duality. (author's abstract)<br>Series: Forschungsberichte / Institut für Sta
APA, Harvard, Vancouver, ISO, and other styles
22

Palmberg, Niklas. "Analytic function spaces : properties of operators and duality /." Åbo : Åbo akademis tryckeri, 2006. http://catalogue.bnf.fr/ark:/12148/cb41037087t.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Chan, Jor-ting, and 陳作庭. "Compact convex sets and their affine function spaces." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1987. http://hub.hku.hk/bib/B30425840.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Chan, Jor-ting. "Compact convex sets and their affine function spaces /." [Hong Kong : University of Hong Kong, 1987. http://sunzi.lib.hku.hk/hkuto/record.jsp?B12344953.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Freund, Robert M., and Fernando 1970 Ordóñez. "On an Extension of Condition Number Theory to Non-Conic Convex Optimization." Massachusetts Institute of Technology, Operations Research Center, 2003. http://hdl.handle.net/1721.1/5404.

Full text
Abstract:
The purpose of this paper is to extend, as much as possible, the modern theory of condition numbers for conic convex optimization: z* := minz ctx s.t. Ax - b Cy C Cx , to the more general non-conic format: z* := minx ctx (GPd) s.t. Ax-b E Cy X P, where P is any closed convex set, not necessarily a cone, which we call the groundset. Although any convex problem can be transformed to conic form, such transformations are neither unique nor natural given the natural description of many problems, thereby diminishing the relevance of data-based condition number theory. Herein we extend the modern the
APA, Harvard, Vancouver, ISO, and other styles
26

Heinrich, André. "Fenchel duality-based algorithms for convex optimization problems with applications in machine learning and image restoration." Doctoral thesis, Universitätsbibliothek Chemnitz, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-108923.

Full text
Abstract:
The main contribution of this thesis is the concept of Fenchel duality with a focus on its application in the field of machine learning problems and image restoration tasks. We formulate a general optimization problem for modeling support vector machine tasks and assign a Fenchel dual problem to it, prove weak and strong duality statements as well as necessary and sufficient optimality conditions for that primal-dual pair. In addition, several special instances of the general optimization problem are derived for different choices of loss functions for both the regression and the classifificati
APA, Harvard, Vancouver, ISO, and other styles
27

Igamberdiev, Alexander [Verfasser], and André [Akademischer Betreuer] Schulz. "A duality transform for realizing convex polytopes with small integer coordinates / Alexander Igamberdiev ; Betreuer: André Schulz." Münster : Universitäts- und Landesbibliothek Münster, 2016. http://d-nb.info/1140436481/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Trienis, Michael Joseph. "Computational convex analysis : from continuous deformation to finite convex integration." Thesis, University of British Columbia, 2007. http://hdl.handle.net/2429/2799.

Full text
Abstract:
After introducing concepts from convex analysis, we study how to continuously transform one convex function into another. A natural choice is the arithmetic average, as it is pointwise continuous; however, this choice fails to average functions with different domains. On the contrary, the proximal average is not only continuous (in the epi-topology) but can actually average functions with disjoint domains. In fact, the proximal average not only inherits strict convexity (like the arithmetic average) but also inherits smoothness and differentiability (unlike the arithmetic average). Then we int
APA, Harvard, Vancouver, ISO, and other styles
29

Ben, Daya Mohamed. "Barrier function algorithms for linear and convex quadratic programming." Diss., Georgia Institute of Technology, 1988. http://hdl.handle.net/1853/25502.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

Samarasinghe, Kasun M. "Sparse Signal Reconstruction Modeling for MEG Source Localization Using Non-convex Regularizers." University of Cincinnati / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1439304367.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Yaskina, Maryna. "Topics in functional analysis and convex geometry." Diss., Columbia, Mo. : University of Missouri-Columbia, 2006. http://hdl.handle.net/10355/4346.

Full text
Abstract:
Thesis (Ph.D.)--University of Missouri-Columbia, 2006.<br>The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file viewed on (March 1, 2007) Vita. Includes bibliographical references.
APA, Harvard, Vancouver, ISO, and other styles
32

Ahmad, Nur Syazreen. "Convex methods for discrete-time constrained control." Thesis, University of Manchester, 2012. https://www.research.manchester.ac.uk/portal/en/theses/convex-methods-for-discretetime-constrained-control(ae161164-767c-41ec-8c03-75779ccc0699).html.

Full text
Abstract:
Feedback is used to control systems whose open-loop behaviour is uncertain. Over the last twenty years a mature theory of robust control has been developed for linear multivariable systems in continuous time. But most practical control systems have constraints such as saturation limits on the actuators, which render the closed-loop nonlinear. Most of the modern controllers are also implemented digitally using computers.The study of this research is divided in two directions: the stability analysis of discrete-time Lur’e systems and the synthesis of static discrete-time anti-windup schemes. Wit
APA, Harvard, Vancouver, ISO, and other styles
33

Bezushko, V. P. "Recognition system of flat convex figures by using disproportionate function." Thesis, Sumy State University, 2017. http://essuir.sumdu.edu.ua/handle/123456789/65234.

Full text
Abstract:
With the development of technologies and optimization of technological processes, it was necessary to perform and making decisions without human intervention. Processes that are associated with unilateral routine work or poses a risk to the humans it is rational to replace by machines. The construction of these machines is the first step towards the construction of different recognition systems.
APA, Harvard, Vancouver, ISO, and other styles
34

Syed, Hasan Nawaz. "Double Functioning Elements." Thesis, Virginia Tech, 2006. http://hdl.handle.net/10919/33726.

Full text
Abstract:
With the increase in the number of functions in the modern age, it has become quite a challenge for an architect to satisfy the requirements and still have an appropriate architectural expression for the materials and the underlying structure. Such challenges may be found both in nature and man made machines, giving rise to elements with multiple functions. This thesis attempts to explore such precedents offered in both architecture and other areas, and apply the ideas and principles in the design of a primary school.<br>Master of Architecture
APA, Harvard, Vancouver, ISO, and other styles
35

Yaskin, Vladyslav. "Applications of the fourier transform to convex geometry." Diss., Columbia, Mo. : University of Missouri-Columbia, 2006. http://hdl.handle.net/10355/4464.

Full text
Abstract:
Thesis (Ph.D.)--University of Missouri-Columbia, 2006.<br>The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file viewed on (March 1, 2007) Vita. Includes bibliographical references.
APA, Harvard, Vancouver, ISO, and other styles
36

Lin, Yier. "Dynamics of a continuum characterized by a non-convex energy function." Thesis, Massachusetts Institute of Technology, 1993. http://hdl.handle.net/1721.1/87809.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Venema, Viktor. "Non-Convex Potential Function Boosting Versus Noise Peeling : - A Comparative Study." Thesis, Uppsala universitet, Statistiska institutionen, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-302289.

Full text
Abstract:
In recent decades, boosting methods have emerged as one of the leading ensemble learning techniques. Among the most popular boosting algorithm is AdaBoost, a highly influential algorithm that has been noted for its excellent performance in many tasks. One of the most explored weaknesses of AdaBoost and many other boosting algorithms is that they tend to overfit to label noise, and consequently several alterative algorithms that are more robust have been proposed. Among boosting algorithms which aim to accommodate noisy instances, the non-convex potential function optimizing RobustBoost algorit
APA, Harvard, Vancouver, ISO, and other styles
38

Nguyen, Thanh Tan. "Selected non-convex optimization problems in machine learning." Thesis, Queensland University of Technology, 2020. https://eprints.qut.edu.au/200748/1/Thanh_Nguyen_Thesis.pdf.

Full text
Abstract:
Non-convex optimization is an important and rapidly growing research area. It is tied to the latest success of deep learning, reinforcement learning, matrix factorization, and more. As a contribution to this area, this thesis provides analyses and algorithms for three important problems. The first one is optimization of noisy functions defined on a large graph, which is useful for AB testing, digital marketing. The second one is learning a convex ensemble of basis models, with application in regression and classification. The last one is optimization of ResNet with restricted residual modules,
APA, Harvard, Vancouver, ISO, and other styles
39

Hendrich, Christopher. "Proximal Splitting Methods in Nonsmooth Convex Optimization." Doctoral thesis, Universitätsbibliothek Chemnitz, 2014. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-149548.

Full text
Abstract:
This thesis is concerned with the development of novel numerical methods for solving nondifferentiable convex optimization problems in real Hilbert spaces and with the investigation of their asymptotic behavior. To this end, we are also making use of monotone operator theory as some of the provided algorithms are originally designed to solve monotone inclusion problems. After introducing basic notations and preliminary results in convex analysis, we derive two numerical methods based on different smoothing strategies for solving nondifferentiable convex optimization problems. The first approa
APA, Harvard, Vancouver, ISO, and other styles
40

Csetnek, Ernö Robert. "Overcoming the failure of the classical generalized interior-point regularity conditions in convex optimization. Applications of the duality theory to enlargements of maximal monotone operators." Doctoral thesis, Universitätsbibliothek Chemnitz, 2009. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-200902025.

Full text
Abstract:
The aim of this work is to present several new results concerning duality in scalar convex optimization, the formulation of sequential optimality conditions and some applications of the duality to the theory of maximal monotone operators. After recalling some properties of the classical generalized interiority notions which exist in the literature, we give some properties of the quasi interior and quasi-relative interior, respectively. By means of these notions we introduce several generalized interior-point regularity conditions which guarantee Fenchel duality. By using an approach due to Ma
APA, Harvard, Vancouver, ISO, and other styles
41

Galdames, Bravo Orlando Eduardo. "Duality theory for p-th power factorable operators and kernel operators." Doctoral thesis, Universitat Politècnica de València, 2013. http://hdl.handle.net/10251/31523.

Full text
Abstract:
El presente trabajo está dedicado al análisis de una clase particular de operadores (lineales y continuos) entre espacios de Banach de funciones. El objetivo es avanzar en la teoría de los llamados operadores factorizables a la p-potencia analizando todos los aspectos de la dualidad. Esta clase de operadores ha demostrado ser de utilidad tanto en la teoría de factorización de operadores sobre espacios de Banach de funciones (teoría de Maurey-Rosenthal) como en el Análisis Armónico (dominios óptimos de la transformada de Fourier y operadores de convolución). A ¿n de desarrollar esta teoría
APA, Harvard, Vancouver, ISO, and other styles
42

Coatney, Ryan D. "Mean Square Estimate for Primitive Lattice Points in Convex Planar Domains." BYU ScholarsArchive, 2011. https://scholarsarchive.byu.edu/etd/2501.

Full text
Abstract:
The Gauss circle problem in classical number theory concerns the estimation of N(x) = { (m1;m2) in ZxZ : m1^2 + m2^2 <= x }, the number of integer lattice points inside a circle of radius sqrt(x). Gauss showed that P(x) = N(x)- pi * x satisfi es P(x) = O(sqrt(x)). Later Hardy and Landau independently proved that P(x) = Omega_(x1=4(log x)1=4). It is conjectured that inf{e in R : P(x) = O(x^e )}= 1/4. I. K atai showed that the integral from 0 to X of |P(x)|^2 dx = X^(3/2) + O(X(logX)^2). Similar results to those of the circle have been obtained for regions D in R^2 which contain the origin and w
APA, Harvard, Vancouver, ISO, and other styles
43

Heinrich, André [Verfasser], Gert [Akademischer Betreuer] Wanka, Gert [Gutachter] Wanka, and Jörg [Gutachter] Fliege. "Fenchel duality-based algorithms for convex optimization problems with applications in machine learning and image restoration / André Heinrich ; Gutachter: Gert Wanka, Jörg Fliege ; Betreuer: Gert Wanka." Chemnitz : Universitätsbibliothek Chemnitz, 2013. http://d-nb.info/1214245315/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Lkhamsuren, Altangerel. "A duality approach to gap functions for variational inequalities and equilibrium problems." Doctoral thesis, Universitätsbibliothek Chemnitz, 2006. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200601214.

Full text
Abstract:
This work aims to investigate some applications of the conjugate duality for scalar and vector optimization problems to the construction of gap functions for variational inequalities and equilibrium problems. The basic idea of the approach is to reformulate variational inequalities and equilibrium problems into optimization problems depending on a fixed variable, which allows us to apply duality results from optimization problems. Based on some perturbations, first we consider the conjugate duality for scalar optimization. As applications, duality investigations for the convex partially separ
APA, Harvard, Vancouver, ISO, and other styles
45

Knapp, Greg. "Minkowski's Linear Forms Theorem in Elementary Function Arithmetic." Case Western Reserve University School of Graduate Studies / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=case1495545998803274.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

Noba, Kei. "Generalized scale functions and refracted processes." Kyoto University, 2019. http://hdl.handle.net/2433/242572.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

Backlund, Ulf. "Envelopes of holomorphy for bounded holomorphic functions." Doctoral thesis, Umeå universitet, Institutionen för matematik och matematisk statistik, 1992. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-141155.

Full text
Abstract:
Some problems concerning holomorphic continuation of the class of bounded holo­morphic functions from bounded domains in Cn that are domains of holomorphy are solved. A bounded domain of holomorphy Ω in C2 with nonschlicht H°°-envelope of holomorphy is constructed and it is shown that there is a point in D for which Glea­son’s Problem for H°°(Ω) cannot be solved. Furthermore a proof of the existence of a bounded domain of holomorphy in C2 for which the volume of the H°°-envelope of holomorphy is infinite is given. The idea of the proof is to put a family of so-called ”Sibony domains” into the
APA, Harvard, Vancouver, ISO, and other styles
48

Rudloff, Birgit. "A generalized Neyman-Pearson lemma for hedge problems in incomplete markets." Universitätsbibliothek Chemnitz, 2005. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200501316.

Full text
Abstract:
Some financial problems as minimizing the shortfall risk when hedging in incomplete markets lead to problems belonging to test theory. This paper considers a generalization of the Neyman-Pearson lemma. With methods of convex duality we deduce the structure of an optimal randomized test when testing a compound hypothesis against a simple alternative. We give necessary and sufficient optimality conditions for the problem.
APA, Harvard, Vancouver, ISO, and other styles
49

Lundqvist, Johannes. "On Amoebas and Multidimensional Residues." Doctoral thesis, Stockholms universitet, Matematiska institutionen, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-82843.

Full text
Abstract:
This thesis consists of four papers and an introduction.  In Paper I we calculate the second order derivatives of the Ronkin function of an affine polynomial in three variables. This gives an expression for the real Monge-Ampére measure associated to the hyperplane amoeba. The measure is expressed in terms of complete elliptic integrals and hypergeometric functions.  In Paper II and III we prove that a certain semi-explicit cohomological residue associated to a Cohen-Macaulay ideal or more generally an ideal of pure dimension, respectively, is annihilated precisely by the given ideal. This is
APA, Harvard, Vancouver, ISO, and other styles
50

Olanders, Julia. "Betweenness." Thesis, Konstfack, Institutionen för design, inredningsarkitektur och visuell kommunikation (DIV), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:konstfack:diva-6954.

Full text
Abstract:
Betweenness is a project questioning the relation between us and what we surround us with. To reveal our assumptions around artifacts and by doing so create an conversation between us viewers/ users and the objects themselves. Who owns the dialogue: the object or the viewer? Taking a deeper dive into the symbols and languages of objects, the quiet voices they posses and the functions surfaces, the visualization circle around words such as visual function, ornamentation,  material displacement and attraction.  By trying to convey the objects “inner thoughts” and creating a dialogue it pushes ou
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!