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 20 for “"Non-smooth Optimization"”.
-
Iteratively Re-weighted Schemes for Non-smooth Optimization
… (IRLS) has long been used to solve both convex optimization problems, including l_1 regression and compressed sensing, as well as non-convex optimization problems, including l_p regression for (0 < p < 1). The thesis is organized as follows. Following the introduction in Chapter 1, in Chapter 2 …
-
Structure and complexity in non-convex and non-smooth optimization
Complexity theory drives much of modern optimization, allowing a fair comparison between competing numerical methods. The subject broadly seeks to both develop efficient algorithms and establish limitations on efficiencies of any algorithm for the problem class. Classical complexity theory based on …
-
Some Problems in Conic, Nonsmooth, and Online Optimization
… with provable guarantees for structured optimization problemsarising in machine learning and theoretical computer science. One of the threads of this thesis is semidefinite programs (SDPs), a problem class with a variety of uses in engineering, computational mathematics, and computer …
-
Interpolation, growth conditions, and stochastic gradient descent
… extend the notion of interpolation to stochastic optimization problems with general, first-order oracles. We use the proposed framework to analyze stochastic gradient descent with a fixed step-size and with an Armijo-type line-search, as well as Nesterov’s accelerated gradient method with …
-
Designing resilient lifeline networks a primal-dual optimization approach
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-09-01 without embargo terms
-
Robust machine learning for complex data: enhancing efficiency and powering healthcare solutions
… medical and computational domains. Effective optimization is crucial in data-driven research, especially as many machine learning methods suffer from non-convex or non-smooth optimization problems. My research explores the Proximal Alternating Linearized Minimization (PALM) technique for …
-
Improved Modeling and Image Generation for Fluorescence Molecular Tomography (FMT) and Positron Emission Tomography (PET)
… with regularization using parallel level sets. A non-smooth optimization algorithm is developed so that the proposed method can be feasibly applied for 3D images and avoid additional blurring caused by conventional smooth optimization process. We evaluate the proposed method using both simulation …
-
Efficient Simulation, Accurate Sensitivity Analysis and Reliable Parameter Estimation for Delay Differential Equations
… a method for adding extra constraints to the optimization problem, changing a possibly non-smooth optimization to a smooth problem. These constraints are effectively handled using information from the simulator and the sensitivity analyzer. Finally, we discuss the structure of our evolving …
-
Challenges in the Optimization Aided Design of Magnetic Confinement Systems
Simulation-based optimization has become a promising method of designing magnetic confinement devices such as stellarators and particle accelerators. Using simulation optimization (SO) methods to design magnetic confinement systems can be challenging since characteristics of the simulation such as …
-
Quantitative temporal logic for safe and robust planning, learning, and control
… STL focuses on critical time points, creating non-smooth optimization landscapes. This dissertation introduces the first quantitative semantics for TWTL, developing both traditional min-max and Arithmetic-Geometric Mean (AGM) robustness. AGM evaluates specification satisfaction holistically …
-
Techniques for Object Tracking: Algorithms and Benchmarks
… object in tracking must be an object other than non-object, we adapt the BING objectness measure to a specific tracking object with adaptive support vector machine. The effectiveness of the proposed adaptive objectness, named ADOBING, is generic. The performance of all the carefully selected base …
-
Non-Convex Phase Retrieval Algorithms and Performance Analysis
… Our vision is to leverage exciting advances in non-convex optimization and statistical learning to devise algorithmic tools that are simple, scalable, and easy-to-implement, while being computationally and statistically (near-)optimal. Phase retrieval is approached from a non-convex optimization …
-
Smooth convex approximation and its applications
In this thesis, we consider a smooth convex approximation to the sum of the $\kappa$ largest components. To make it applicable to a wide class of applications, the study is conducted on some minmax problems. Based on a special smoothing technique, we give an efficient scheme for nonsmooth convex …
-
Block Coordinate Update Method in Tensor Optimization
… solve. However, for certain problems such as the nonnegative tensor decomposition, the block subproblems can be difficult to solve, or even if they are solved exactly or to high accuracies, BAM can perform badly on solving the original problem, in particular on non-convex problems. On the other …
-
The Clarke Derivative and Set-Valued Mappings in the Numerical Optimization of Non-Smooth, Noisy Functions
… tool for the convergence analysis of numerical optimization methods. It is based on the concepts of the Clarke derivative and set-valued mappings. Our goal is to apply this tool to minimization problems with non-smooth and noisy objective functions. After deriving a necessary condition for …
-
Representation Learning for Partitioning Problems
… points are two classical partitioning problems. Nonparametric methods such as kernel-based methods assume the knowledge of a mapping into a feature space. Their statistical performance can, however, be impeded if this mapping, usually called a feature representation, is improperly specified or …
-
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 …
-
Theoretical and numerical investigation of optimal control problems governed by kinetic models
… costs are taken into account which leads to non--smooth optimization problems. For the theoretical investigation of the resulting optimal control problems, a well--posedness theory in weighted Sobolev spaces is presented for Liouville and related transport equations. Specifically, existence …
-
Towards new perspectives on stochastic optimization: bridging theory and practice
Optimization theory is a cornerstone of machine learning. At the core of training deep neural networks lies the optimization of a loss function. However, despite the success of widely-used empirical optimizers and advancements in theoretical frameworks, a notable gap between theory and practice …