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 465 for “"Nonconvex"”.
-
Nonconvex Dynamical Problems
… to nonlinear partial differential equations. The nonconvexity of their underlying energy potential is a challenge for mathematical analysis, since convexity plays an important role in the classical theories of existence and regularity. In the last years one main point of interest was to develop …
-
Tensor methods for nonconvex optimization
… <em>methods with regularization</em> for nonconvex optimization have garnered significant research interest. These methods offer superior local convergence rates and improved worst-case evaluation complexity, where complexity is measured by the number of function and derivative evaluations …
-
Convex and nonconvex optimization geometries
… and signal processing problems are fundamentally nonconvex. One way to solve them is to transform them into convex optimization problems (a.k.a. convex relaxation), which constitutes a major part of my research. Although the convex relaxation approach is elegant in some ways that it can give …
-
A Nonsmooth Nonconvex Descent Algorithm
In many applications nonsmooth nonconvex energy functions, which are Lipschitz continuous, appear quite naturally. Contact mechanics with friction is a classic example. A second example is the 1-Laplace operator and its eigenfunctions. In this work we will give an algorithm such that for every …
-
Nonconvex and Nonsmooth Inverse Problems
… Here, we focus on solving nonsmooth and nonconvex inverse problems.These properties are increasingly prevalent in modern applications yet typically approximated in many settings to simplify analysis. Such difficulties preclude common algorithms, giving rise to approaches that are highly …
-
SPARSE RECOVERY BY NONCONVEX LIPSHITZIAN MAPPINGS
… on fixed-point iteration scheme which combines nonconvex Lipschitzian-type mappings with canonical orthogonal projectors. The first are aimed at uniformly enhancing the sparseness level by shrinking effects, the latter to project back into the feasible space of solutions. In the second part of …
-
Nonconvex Optimization Methods Under Inexact Information
… convergence analysis of algorithms for solving nonconvex optimization problems under inexact first-order information. We introduce Inexact Reduced Gradient (IRG) methods for general smooth functions and Inexact Gradient Descent (IGD) methods for $\mathcal{C}^{1,1}_L$ functions with relative and …
-
ON RICCATI EQUATIONS IN NONCONVEX OPTIMIZATION
… or methods lacking worst-case guarantees. Nonconvexity does not always invalidate the intuition and methods developed for convex problems, especially when especially when some of the structures leading to convexity remain intact. It is often possible to preserve feasibility through …
-
Nonconvex projections arising in bilinear mathematical models
This thesis contributes to the study of projection operators associated with bilinear sets. Bilinear sets are not convex and appear in many applications such as deep learning, inverse problems, and other bilinear models in control and optimization. The closed-form projection formulas for some of …
-
CQ algorithms : theory, computations and nonconvex extensions
… algorithm. The SFP is extended into two nonconvex cases. The first one is on S-subdifferentiable functions, and the other one is on prox-regular functions. The subgradient projection algorithm and CQ algorithm are proved to converge to a solution of the first and second case respectively.
-
Proximal Methods for Nonconvex Composite Optimization Problems
Optimization problems with composite functions deal with the minimization of the sum of a smooth function and a convex nonsmooth function. In this thesis several numerical methods for solving such problems in finite-dimensional spaces are discussed, which are based on proximity operators. After …
-
Nonconvex Optimization Methods: Iteration Complexity And Applications
… in many fields. Despite the hardness of nonconvexity, a large number of these applications are dealing with nonconvex optimization problems. In this thesis, we shall focus on several different aspects of nonconvex optimization algorithms and their complexity results, including the …
-
Distributed nonconvex optimization algorithms with compressed communication
… applications, the cost function is inherently nonconvex. Moreover, distributed optimization algorithms involve data spread across multiple agents, thereby requiring each agent to communicate with its neighbors. However, one of the main challenges is the communication bottleneck, which can occur …
-
A Framework for Nonconvex Robust Subspace Recovery
… develop optimal algorithms due to its underlying nonconvexity. We give a comprehensive review of the algorithms developed for RSR in the first chapter of this thesis. After this, we will discuss our proposed solutions to this problem. The first proposed algorithm, which we refer to as Fast Median …
-
Analysis of Convex Relaxations for Nonconvex Optimization
Nonconvex optimizations are ubiquitous in many application fields. One important aspect of dealing with a nonconvex optimization problem is to study its convex relaxation, which is often part of some approximation algorithms that can find quality solutions to the original nonconvex problem. In this …
-
NONSMOOTH NONCONVEX OPTIMIZATION AND ROBUST CONVEX MODELS
… combining theoretical advances in nonsmooth nonconvex algorithms and applied models for decision-making under uncertainty, emphasizing both rigor and applicability. In nonsmooth nonconvex optimization, stochastic gradient methods are widely used but lack finite-time complexity guarantees. A …
-
Bayesian coresets: Revisiting the nonconvex optimization perspective
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-11 without embargo terms
-
Minimizing Nonconvex Quadratic Functions Subject to Bound Constraints
… algorithm for finding a local minimizer to a nonconvex bound-constrained quadratic problem. Our algorithm extends the ideas developed by Dost al and Sch oberl that is based on the linear conjugate gradient algorithm for (approximately) solving a linear system with a positive-de finite …
Page 1 of 24