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 47 for “"Nonsmooth optimization"”.
-
A theory for model-based nonsmooth optimization
Weanalyse and develop a gradient-free optimisation framework for functions l :Rd →R that are not assumed to be convex, differentiable, or even continuous. The central idea is to approximate l recursively by fitting it to a parametric family of probability distributions. Each iteration consists of a …
-
SMOOTH QUASI-NEWTON METHODS FOR NONSMOOTH OPTIMIZATION
The success of Newton’s method for smooth optimization, when Hessians are available, motivated the idea of quasi-Newton methods, which approximate Hessians in response to changes in gradients and result in superlinear convergence on smooth functions. Sporadic informal observations over several …
-
Theory And Algorithms For Structured Nonsmooth Optimization
Nonsmoothness in optimization is typically highly structured, and this structure is fundamental to any understanding of many concrete settings. This dissertation, consisting of two core chapters (followed by some further developments), studies structured nonsmooth optimization from both theoretical …
-
Complexity, conditioning, and saddle avoidance in nonsmooth optimization
Continuous optimization has become a prevalent tool across the sciences and engineering. Modern applications have displayed steady growth in problem sizes. Such sizes often prohibit the use of classical algorithmic solutionsthat heavily rely on costly operations, such as matrix inversion, and do …
-
Saddle Avoidance, Asymptotic Normality, and Exponential Acceleration in Nonsmooth Optimization
Optimization-based algorithms are the foundation for empirically successful methods in modern fields, such as artificial intelligence and data science. Although classical optimization theory provides guarantees for functions with smoothness or convexity, a significant portion of modern problems do …
-
Enhanced Optimality Conditions and New Constraint Qualifications for Nonsmooth Optimization Problems
… conditions for a class of very general nonsmooth optimization problems called the mathematical program with geometric constraints (MPGC). The geometric constraint means that the image of certain mapping is included in a nonempty and closed set. We first study the conventional nonlinear …
-
Long term motion analysis for object level grouping and nonsmooth optimization methods
Die wissenschaftliche Arbeit beschäftigt sich in einem ersten Teil mit konvexen und nichtkonvexen Optimierungsmethoden für bestimmte Problemklassen. Diese Optimierungsmethoden finden insbesondere Anwendung bei der Lösung vieler grundlegender Problemstellungen im Bereich Computer Vision. Als ein …
-
Convex and Nonconvex Optimization Techniques for Multifacility Location and Clustering
… rules for generalized differentiation and optimization methods for solving nonsmooth nonconvex problems with applications to multifacility location and clustering. A variational geometric approach is used for developing calculus rules for subgradients and Fenchel conjugates of convex …
-
Partly Smooth Models and Algorithms
Optimization and variational problems typically involve a highly structured blend of smooth and nonsmooth geometry. In nonlinear programming, such structure underlies the design of active-set algorithms, in which a globally convergent process first simplifies the problem by identifying active …
-
An inexact deflected subgradient algorithm with applications to optimal control problems
… is a powerful tool for solving nonconvex optimization problems. In this work first we provide a general Lagrangian in the primal-dual framework for solving nonconvex and nonsmooth optimization problems in infinite dimensions. Then we design a deflected subgradient algorithm using our …
-
Blackbox optimization, Nonsmooth Structure, and Survey Descent
First-order, blackbox optimization methods aim to minimize objective functions using only function and gradient evaluations. On smooth, strongly-convex objectives; classical results ensure the linear convergence of these methods relative to the number of function and gradient evaluations. An …
-
Minimax robust designs for misspecified regression models
… desired efficiency through one parameter. Using nonsmooth optimization technique, we derive the minimax designs analytically for misspecified regression models. This extends the results in Heo, Schmuland and Wiens (2001). Several examples are discussed for approximately polynomial regression.
-
Distributed cooperative trajectory generation for multiple autonomous vehicles using Pythagorean Hodograph Bézier curves
… problem, that falls under the class of nonsmooth optimization problems. The proposed distributed algorithm combines the bundle method, a widely used solver for nonsmooth optimization problems, with a distributed nonlinear programming method. In the latter, a distributed formulation is …
-
Convergence of gradient-like dynamical systems and optimization algorithms
… part of this work discrete-time gradient-like optimization methods on manifolds are studied. Methods for smooth and for nonsmooth optimization problems are considered. For these methods some convergence results are proven. Additionally the optimization methods for nonsmooth cost functions are …
-
Generalized Coderivative-Based Newtonian Methods In Nonsmooth Nonconvex Optimization And Applications
… new Newton-type methods to solve nonconvex and nonsmooth optimization problems with justifying their fast local and global convergence by means of advanced tools of variational analysis and generalized differentiation. The objective functions belong to a broad class of prox-regular functions …
-
Full Stability In Optimization
… a systematic study of full stability in general optimization models including its conventional Lipschitzian version as well as the new Holderian one. We derive various characterizations of both Lipschitzian and Holderian full stability in nonsmooth optimization, which are new in …
-
Approximate subdifferential of piecewise linear-quadratic functions
Optimization is a branch of mathematics dealing with the selection of the best element(s) (based on some criteria) from a set of available options. In the study of optimization, we often come across problems involving functions that are not differentiable, thus, one cannot employ the tool of …
-
Some Extensions on the Reach of First-Order Optimization Theory
… thesis concerns the foundations of first-order optimization theory. In recent years, these methods have found tremendous success in a wide range of domains due to their incredibly scalable nature. We aim to extend the reach of first-order optimization guarantees, lessening the gap between …
-
Design and Analysis of Algorithms for Composite Optimization
… (FOMs) for solving three types of composite optimization problems: convex nonsmooth, convex hybrid, and nonconcex smooth. We revisit three representative methods among FOMs: proximal point, proximal bundle, and accelerated composite gradient (ACG). We use them to design fast algorithms for …
Page 1 of 3