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 36 for “"first-order method"”.
-
A first-order method for the extremization of constrained and unconstrained functions
… Since the performance index R(y) involves the first derivatives f and cp^, the gradient G(y) = R^(y), which is employed in quadratically convergent algorithms, involves the second derivatives f and cp . To avoid the explicit use of these second derivatives, a two-point determination of the …
-
FIRST-ORDER METHODS FOR NONSMOOTH NONCONVEX FUNCTIONAL CONSTRAINED OPTIMIZATION WITH OR WITHOUT SLATER POINTS
… settings. In this paper, we show a simple first-order method finds a feasible, ϵ-stationary point at a convergence rate of O(ϵ−4) without relying on compactness or Constraint Qualification (CQ). When CQ holds, this convergence is measured by approximately satisfying the Karush-Kuhn-Tucker …
-
A Robust Second Order Invariant-Domain Preserving Approximation of the Compressible Euler Equations with an Arbitrary Equation of State
For many physical problems, robust numerical methods for solving the compressible Euler equations are essential. For the Euler equations to accurately describe the fluid behavior a suitable equation of state (EOS), which describes the relationship between the thermodynamic variables, must be …
-
RADIAL PROJECTIONS, CONVEX FEASIBILITY PROBLEMS AND MARGIN MAXIMIZATION
… convergence rates of orthogonal projection-based methods. Through studying different assumptions on the emptiness of the interior of the intersection set in the convex feasibility problem, we also exhibit how radial projections can be applied to solve constrained optimization problems when certain …
-
Fast probing of many Earth models with full waveforms
<p>Seismology is our primary method for inferring the structure and dynamics of Earth’s interior. A region of particular importance is the lowermost mantle near the core-mantle boundary. Detailed information about lowermost mantle seismic structures can be inferred by comparing synthetic seismic …
-
Saddle Avoidance, Asymptotic Normality, and Exponential Acceleration in Nonsmooth Optimization
… 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 not possess any of these. …
-
Optimal First Order Methods for Reducing Gradient Norm in Unconstrained Convex Smooth Optimization
… thesis, we focus on convergence performance of first-order methods to compute an $\epsilon$-approximate solution of minimizing convex smooth function $f$ at the $N$-th iteration. In our introduction of the above research question, we first introduce the gradient descent method with constant step …
-
A new first order solution to the relative motion problem with applications to intercept and rendezvous
An improved first order linearized solution, describing the relative motion between an interceptor vehicle and a target vehicle in a circular orbit, has been developed by means of a transformation of the variables which occur in the differential equations of relative motion. The results of this …
-
The estimation of pack-ice motion in digital satellite imagery by matched filtering
… the filter which is not possible through ad hoc methods. The noise corrupting the filtering process is investigated and the filter is implemented through both a first order method common to image processing, and a more sophisticated second order approach from computational vision. The class of …
-
Algorithms for convex optimization with applications to data science
… and engineering. Nesterov introduced optimal first-order methods for large scale convex optimization in the 1980s, and extremely fast interior point methods for small-to-medium scale convex optimization emerged in the 1990s. Today there is little reason to prefer modelling with linear …
-
FAST RATE ANALYSIS OF STOCHASTIC OPTIMIZATION IN STATISTICAL ESTIMATION
… level. Our study focuses on the stochastic first order method for the high dimensional statistics model. In particular, we investigate the convex stochastic optimization problem and propose the modified regret to relax the strong convexity assumption in some well-known algorithms. We then …
-
Sparsity and Smoothness and Their Application in Cryo-EM Single Particle Analysis
We presented a new 3D refinement method for Cryo-EM single particle analysis which can improve the resolution of final electron density map in this thesis. We proposed to enforce both sparsity and smoothness to alleviate the ill-posedness of Cryo-EM based 3D reconstruction problem and improve the …
-
Multigrid methods in convex optimization with application to structural design
… has investigated the use of multigrid methods in certain classes of optimization problems, with emphasis on structural, namely topology optimization. We have investigated the solution bound constrained optimization problems arising in discretization by the finite element method, such as …
-
Proximal Methods for Nonconvex Composite Optimization Problems
… function. In this thesis several numerical methods for solving such problems in finite-dimensional spaces are discussed, which are based on proximity operators. After some basic results from convex and nonsmooth analysis are summarized, a first-order method, the proximal gradient method, is …
-
An Extension of Essentially Non-Oscillatory Shock-Capturing Schemes to Multi-Dimensional Systems of Conservation Laws
… has been developed which generalizes the first-order method of Godunov to arbitrary order of accuracy. High-order accuracy is obtained, wherever the solution is smooth, by an essentially non-oscillatory (ENO) piecewise polynomial reconstruction procedure, which yields high-order pointwise …
-
Sufficient Dimension Reduction with Orthogonality Constraint through Manifold Optimization
… thereby achieving dimension reduction. SDR methods typically fall into two main frameworks: the inverse approach and the forward approach. In practice, the basis matrix of the CS is the primary object of interest. The inverse approach naturally fulfills the orthogonality constraint of the …
-
Solving Saddle Point Formulations of Linear Programs with Frank-Wolfe
… LP solvers make use of the Simplex method and primal-dual interior-point methods which are able to provide accurate solutions in a reasonable amount of time for most problems. However, both the Simplex method and interior-point methods require solving a system of linear equations at …
-
A Robust Lagrangian Framework for Compressible Flow & Hyperelasticity
… of numerical schemes that not only achieve high-order accuracy but also preserve key physical invariants of the governing equations. This thesis will focus on the development of a robust first order invariant-domain preserving method for Lagrangian cell-centered hydrodynamics with an arbitrary …
-
A Robust Lagrangian Framework for Compressible Flow & Hyperelasticity
… of numerical schemes that not only achieve high-order accuracy but also preserve key physical invariants of the governing equations. This thesis will focus on the development of a robust first order invariant-domain preserving method for Lagrangian cell-centered hydrodynamics with an arbitrary …
-
A Robust Lagrangian Framework for Compressible Flow & Hyperelasticity
… of numerical schemes that not only achieve high-order accuracy but also preserve key physical invariants of the governing equations. This thesis will focus on the development of a robust first order invariant-domain preserving method for Lagrangian cell-centered hydrodynamics with an arbitrary …
Page 1 of 2