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 24 for “"Interior-Point Method"”.
-
Computational Study of Kernel - Based Interior - Point Method for LCP
… and analyzing a kernel-based primal-dual interior-point method (IPM) for solving LCP, we consider several, fairly general, eligible kernel functions. We show that the algorithm, with some of those kernel functions, has comparable complexity with the best complexity results obtained in the …
-
Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems
<p>In this thesis, we present a new Interior-Point Method (IPM) for monotone Linear Complementarity Problem (LPC). The advantage of the method is that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. However, by suitable choice of parameters the iterates …
-
Improved Full-Newton-Step Infeasible Interior-Point Method for Linear Complementarity Problems
… we present an improved version of Infeasible Interior-Point Method (IIPM) for monotone Linear Complementarity Problem (LCP). One of the most important advantages of this version in compare to old version is that it only requires feasibility steps. In the earlier version, each iteration …
-
Infeasible Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems
<p>In this tesis, we present a new Infeasible Interior-Point Method (IPM) for monotone Linear Complementarity Problem (LPC). The advantage of the method is that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. However, by suitable choice of parameters …
-
A Conic Quadratic Interior-Point Method for a Class of Stratified Sampling Problems
… of this thesis is to numerically test two interior point methods on the stratified sampling problem. First, a homogeneous conic quadratic interior point method was used to solve the stratified sampling problem as a reformulated conic quadratic problem Then, a nonlinear homogeneous interior …
-
Full Newton Step Interior Point Method for Linear Complementarity Problem Over Symmetric Cones
<p>In this thesis, we present a new Feasible Interior-Point Method (IPM) for Linear Complementarity Problem (LPC) over Symmetric Cones. The advantage of this method lies in that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. By suitable choice of …
-
A modified augmented Lagrangian merit function, and Q-superlinear characterization results for primal-dual Quasi-Newton interior-point method for nonlinear programming
Two classes of primal-dual interior-point methods for nonlinear programming are studied. The first class corresponds to a path-following Newton method formulated in terms of the nonnegative variables rather than all primal and dual variables. The centrality condition is a relaxation of the …
-
Studies integrating geometry, probability, and optimization under convexity
… ones. In particular, we provide probabilistic methods that carry out such task efficiently by exploiting the geometry of the problem. More specific contributions of this dissertation are as follows. (i) We conduct a broad exploration of the symmetry function of convex sets and propose efficient …
-
Análise do problema de máxima geração distribuída observando o critério estático da estabilidade de tensão
… classical Optimal Power Flow (OPF), solved by an Interior-Point Method combined with Scatter Search Metaheuristics. The MHC problem, invariably constrained either by overvoltages or overcurrents, may yield a solution that can lie in the bottom part of the classical PV curve in static voltage …
-
Kernel-Based Interior-Point Algorithms for the Linear Complementarity Problem
… equation. A kernel-based primal-dual Interior-Point Method (IPM) for solving LCP was introduced and analyzed. The class of kernel functions used in this thesis is a class of so-called eligible kernel functions that are fairly general. We have shown for a positive semi-definite matrix …
-
Robust stability analysis for large-scale power systems
… power systems. We use preconditioned iterative methods to solve the Newton direction computation in the interior-point method, in order to avoid the O(n6) time complexity associated with a dense-matrix approach. The per-iteration costs of the iterative methods are reduced to O(n3) through a …
-
A Feasibility Problem Approach For Reachable Set Approximation
… to check the reachability of discrete grid points of a reachable set which is approximated via an equidistant grid discretization. We use the concept of interior point methods to develop an algorithm for solving many feasibility problems synchronously. Through a suitable problem definition …
-
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 algorithms for the solution of linear programs with special structural features
… was mainly due to the efficiency of the simplex method. After the appearance of Karmarkar's paper, the focus of most research was shifted to the field of interior point methods. The present work is concerned with investigating and efficiently implementing the latest techniques in this field …
-
Modeling and estimation in Gaussian graphical models : maximum-entropy methods and walk-sum analysis
… our procedure from standard combinatorial methods. In our approach, we seek the maximum entropy relaxation (MER) within an exponential family, which maximizes entropy subject to constraints that marginal distributions on small subsets of variables are close to the prescribed marginals in …
-
Faster algorithms for matrix scaling and balancing via convex optimization
… by providing a separate algorithm that uses an interior-point method and runs in time Õ(m³/²(log log K + log(1/[epsilon]))), which becomes Õ(m³/² log(1/[epsilon])) for the case of matrix balancing and the doubly-stochastic variant of matrix scaling. In order to establish these results, we …
-
Numerical approaches to optimize dispatch on microgrids with energy storage
… For real time dispatch, four optimization methods including active-set, interior-point method, sequential quadratic programming (SQP) and trust-region-reflective are discussed and compared to find the relatively fast and robust optimization algorithm. The computation was implemented by …
-
Preliminary design tools in turbomachinery: Non-uniformly spaced blade rows, multistage interaction, unsteady radial waves, and propeller horizontal-axis turbine optimization
… deep physical insight and a good starting point for the later CFD analyses. Four analytical/semi-analytical models are developed in this study: 1) a generalized flat plate cascade model for investigating the unsteady aerodynamics of a blade row with non-uniformly spaced blades; 2) a …
-
Control Theoretic Methods In Analysis And Design Of Optimization Algorithms
… directions. In the first part, we develop an interior-point method for solving a class of convex optimization problems with time-varying objective and constraint functions. This dynamical system is composed of two terms: (i) a correction term consisting of a continuous-time version of Newton's …
-
Computational Multi-material Inverse Design of Soft Robotic Actuators via Nonlinear Functional Optimization
… is the proposal of a new physics-based method for the computational design of soft hyperelastic robotic actuators to address this problem. The method takes as input an undeformed robot shape, a specified external load, and a user desired final shape. It then solves an inverse problem in …
Page 1 of 2