Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 145 for “"dual problem"”.
-
Farkas - type results for convex and non - convex inequality systems
… give the desired results, we treat optimization problems which involve convex and composed convex functions or non - convex functions like DC functions or fractions. To be able to use the fruitful Fenchel - Lagrange duality approach, to the primal problem we attach an equivalent problem which is …
-
Convex duality in constrained mean-variance portfolio optimization under a regime-switching model
… we solve a mean-variance portfolio optimization problem with portfolio constraints under a regime-switching model. Specifically, we seek a portfolio process which minimizes the variance of the terminal wealth, subject to a terminal wealth constraint and convex portfolio constraints. The …
-
Fenchel duality-based algorithms for convex optimization problems with applications in machine learning and image restoration
… 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 …
-
Quadratic Hedging with Margin Requirements and Portfolio Constraints
… consider a mean-variance portfolio optimization problem, namely, a problem of minimizing the variance of the final wealth that results from trading over a fixed finite horizon in a continuous-time complete market in the presence of convex portfolio constraints, taking into account the cost imposed …
-
General Quadratic Risk Minimization: a Variational Approach
… be subsumed within the framework of a general problem of quadratic risk minimization. We study this quadratic risk minimization problem in the setting of an It^o process market model with random market parameters. Our particular contribution is to introduce a combination of constraints on both …
-
Improving Lower Bound for Aircraft Routing Optimization. An Application of Lagrange Relaxation
Aircraft routing is a complicated optimization problem which can be modelled as a form of resource-constrained integer multi-commodity network flow problem. When optimizing this problem, a good lower bound is useful to assess the quality of feasible solutions and for determining convergence of the …
-
An Improved Lagrangian Relaxation Method for VLSI Combinational Circuit Optimization
… under discrete solution space. The Lagrangian dual problem is non-convex and previously a sub-gradient method was used to solve it. The sub-gradient method is a greedy approach for substituting gradient method in the deepest descent method, and has room for further improvement. In addition, …
-
Sustainability Policy’s Inherent Dilemmas – Exemplified Via Critical Examination of the Las Vegas Metropolitan Sustainability Campaign
In response to a dual problem of critical water scarcity and rapid population growth, leaders of metropolitan Las Vegas implemented a region-wide, internationally marketed sustainability campaign. Preliminary studies found that, while sustainability policy attains its rhetorical goals, solutions …
-
A Projection-Free Algorithm for Solving Support Vector Machine Models
In this thesis our goal is to solve the dual problem of the support vector machine (SVM) problem, which is an example of convex smooth optimization problem over a polytope. To this goal, we apply the conditional gradient (CG) method by providing explicit solution to the linear programming (LP) …
-
Quadratic minimization and least distance programming
Quadratic minimization problems constitute a significant and important subset of optimization problems. Research has shown that a convex quadratic programming problem can be reduced to a least distance programming problem using a unique and non-singular "linear least distance transformation." A …
-
Formality and finite ambiguity
… distinguishing homotopy types. We consider the problem of when there are only a finite number of homotopy equivalence classes in the collection of simply connected, finite CW complexes, for which the cohomology algebra is isomorphic to a given algebra. We prove that, if we restrict ourselves to …
-
Distributed Newton-Seeking for Resource Allocation
… an approach to solve resource allocation problems in a fully distributed fashion where the separable cost function is unknown with dynamics in discrete time. To accomplish this, we utilize a distributed extremum-seeking scheme that estimates the cost function’s gradient and Hessian to …
-
EFFICIENT DATA ASSOCIATION ALGORITHMS FOR MULTI-TARGET TRACKING
In this work, we propose a novel convex dual approach to the multidimensional dimensional assignment problem, which is an NP-hard binary programming problem. It is shown that the proposed dual approach is equivalent to the Lagrangian relaxation method in terms of the best value attainable by the …
-
DUALITY IN NONLINEAR VECTOR OPTIMIZATION
… we attempted to give a systematic account of duality theory for a convex vector optimization nonlinear programming problem, In mathematical programming, duality means in association to, say a minimization problem, we maximize a related problem, called its dual. Occasionally, the dual problem …
-
Limited broadcast domination
… as a solution to an integer linear programming problem. The solution to the dual problem is defined as the k-limited multipacking number. We begin with a survey of known results and background related to these broadcast domination related parameters. In Chapter 3, we give a proof of …
-
Study on Two Optimization Problems: Line Cover and Maximum Genus Embedding
In this thesis, we study two optimization problems which have a lot of important applications in diverse domains: Line Cover Problem (LCP) in Computational Geometry and Maximum Genus Embedding (MGE) in Topological Graph Theory. We study LCP whose decision version is known NP-Complete from the …
-
Option Pricing and Hedging with Regret Optimisation
… and hedging based on a regret optimisation problem in a discrete-time financial market model with proportional transaction costs. In such model, the no-arbitrage price interval can be very large. Such large interval makes it difficult for an investor to choose the “right” prices, which is a …
-
Local Estimation of Modeling Error in Multi-Scale Modeling of Heterogeneous Elastic Solids
… error in the analysis of linear elastostatic problems of heterogeneous solids. Due to the increase in the use of multiphase composites in structural engineering applications in the past three or four decades, the numerical analysis of their mechanical response has accordingly gained …
-
An accelerated dual method for SPGL1
… process to solve the basis pursuit denoising problem. This process involves a nested loop. The outer loop is an inexact Newton root-finding process, and the inner loop approximately solves LASSO (least absolute shrinkage and selection operator). We propose an accelerated dual method to …
-
A Semismooth Newton-CG Augmented Lagrangian Method for Large Scale Linear and Convex Quadratic SDPS
… and convex quadratic semidefinite programming problems from the perspective of approximate semimsooth Newton methods. Under the framework of Euclidean Jordan algebras, we study the properties of these minimization problems and analyze the convergence of our proposed method. As a special case, …
Page 1 of 8