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 “"point methods"”.
-
Material Point Methods For Simulating Material Fracture
… most existing approaches focus on meshed methods such as FEM or BEM that require computationally intensive crack tracking and re-meshing procedures. Conversely, the Material Point Method (MPM) is a hybrid meshless approach that is ideal for modeling fracture due to its automatic support …
-
Scaling and Interior Point Methods in Optimization
… algorithms that use either scaling or interior point methods for convex optimization problems; two of the algorithms use both.
-
Ghost-point methods for Elliptic and Hyperbolic Equations
In questa tesi abbiamo presentato un metodo ghost-point alle differenze finite per la risoluzione numerica delle equazioni ellittiche e iperboliche su domini arbitrari. Le equazioni sono discretizzate su una griglia Cartesiana regolare. In un primo momento abbiamo applicato il metodo Coco-Russo, …
-
Fixed Point Methods in Convex Minimization for Large Data
So-called first order methods are widely used in machine learning methods involving big data because of their conceptual and algorithmic simplicity. The central problem in this paper is the optimization problem x0 ∈ arg min_{x∈C} f (x) on a suitable convex and closed domain C ⊆ R^n stemming from a …
-
Interior-point methods for linear and mixed complementarity problems
An infeasible interior-point method with backtracking line search is proposed to solve the linear complementarity and the general mixed complementarity problem. The standard nonlinear complementarity problem is a special case of the latter problem. The algorithm is based on a method for the general …
-
Reoptimization in interior-point methods with application to integer programming
… current reoptimization techniques for interior-point methods available in the literature and studies their efficacy in a branch-and-bound framework for 0/1 mixed integer programming problems. This work is motivated by the observation that there are instances of integer programming problems where …
-
Inexact interior point methods for constrained convex quadratic optimization problems
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-15 without embargo terms
-
Interior-point methods for minimization of potential energy functions of polypeptides
Interior-point methods to minimize nonlinear, nonconvex potential energy function of proteins constrained by the bounds on dihedral angles are proposed. The first approach uses a barrier function to transform the original problem into a sequence of subproblems. First-order necessary conditions are …
-
Augmentation preconditioning for saddle point systems arising from interior point methods
… linear systems arising from primal-dual interior point algorithms in linear and quadratic programming. The preconditioner has the attractive property of improved eigenvalue clustering with increased ill-conditioning of the (1,1) block of the saddle point matrix. We demonstrate performance of the …
-
Effective finite termination procedures in interior-point methods for linear programming
… linear program cannot be computed by an interior-point algorithm without adding features, such as finite termination procedures, to the algorithm. Finite termination procedures attempt to compute an exact solution in a finite number of steps. The addition of a finite termination procedure enables …
-
Geometric multigrid and closest point methods for surfaces and general domains
… and practical aspects of applying the Closest Point Method to solve elliptic partial differential equations (PDEs) on smooth surfaces and domains with smooth boundaries. A new numerical scheme is proposed to solve surface elliptic PDEs and a novel geometric multigrid solver is constructed to …
-
Interior Point Methods and Kernel Functions of a Linear Programming Problem
In this thesis the Interior -- Point Method (IPM) for Linear Programming problem (LP) that is based on the generic kernel function is considered. The complexity (in terms of iteration bounds) of the algorithm is first analyzed for a class of kernel functions defined by (3-1). This class is fairly …
-
Using interior point methods to solve the multicommodity network flow problem.
This thesis explores applications of Interior Point methods as popularized by Karmarkar (36) for solving Multicommodity Network Flow problems (MCNF). In these problems, several commodities must be shipped between various nodes of a network. The goal is to satisfy the shipping requirements at a …
-
Closest point methods with polyharmonic spline radial basis functions and local refinement
Closest point methods are a class of embedding methods that have been used to solve partial differential equations on surfaces with the closest point representation of the surface. Recently, several studies replaced the standard Cartesian grid methods in the original Closest point methods with …
-
Convex Optimization via Domain-Driven Barriers and Primal-Dual Interior-Point Methods
… of infeasible-start primal-dual interior-point methods for convex optimization problems. Convex optimization has applications in many fields of engineering and science such as data analysis, control theory, signal processing, relaxation and randomization, and robust optimization. In …
-
On Polynomial-time Path-following Interior-point Methods with Local Superlinear Convergence
Interior-point methods provide one of the most popular ways of solving convex optimization problems. Two advantages of modern interior-point methods over other approaches are: (1) robust global convergence, and (2) the ability to obtain high accuracy solutions in theory (and in practice, if the …
-
Inexact Interior-Point Methods for Large Scale Linear and Convex Quadratic Semidefinite Programming
Interior-point methods have been intensively studied during the last few decades. In theory, interior-point methods can solve a wide range of convex programming problems to high accuracy in polynomial time. In practice, the difficulty faced by interior-point methods is to compute the search …
Page 1 of 8