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 81 for “"interior point"”.
-
Scaling and Interior Point Methods in Optimization
… four algorithms that use either scaling or interior point methods for convex optimization problems; two of the algorithms use both.
-
Techniques for handling nonsymmetric cones in interior point algorithms
… are amenable to highly efficient primal-dual interior point methods, which are implemented by many popular off-the-shelf conic solvers. On the other hand, many useful conic sets cannot be modeled exactly or can be modeled more efficiently using cones that are not symmetric. Algorithms for …
-
Interior point and outer approximation methods for conic optimization
… the generality and practical performance of (i) interior point methods for continuous conic problems and (ii) outer approximation methods for mixed-integer conic problems. We implement our algorithms in extensible open source solvers accessible through the convenient modeling language JuMP. From …
-
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 …
-
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 …
-
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 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 …
-
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 …
-
Interior-point algorithms for solving linear complementarity problems and their applications
… a brief historical background of the theory of interior-point algorithms (IPAs). We discuss the concept of algebraically equivalent transforma-tion technique (AET) and outline the role of this method in the theory of IPAs. To motivate our research, we present several problems that can be written …
-
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 …
-
Lower-bound shakedown analysis of pavements by using the interior point method
… contact as well as repeated stationary line and point contacts is introduced. The material is assumed to be rate-independent elastic-plastic. As yield conditions, the rounded Mohr-Coulomb, Tresca and von Mises yield criteria are used, assuming associated flow rules. The proposed numerical method …
-
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 …
-
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 …
-
Using interior point algorithms for the solution of linear programs with special structural features
… 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 taking sparsity into account. The performance of these implementations on different classes of LP problems is …
-
Wave Propagation in a Half-Space Due to an Interior Point-Load Parallel to the Surface
Made available in DSpace on 2014-12-10T22:21:56Z (GMT). No. of bitstreams: 1 7317264.pdf: 4170417 bytes, checksum: 9560eeb565428c3c337791007289e26a (MD5) Previous issue date: 1972
-
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 …
-
Perspectives on Geometry and Optimization: from Measures to Neural Networks
… geometrical aspects of matrix completion, interior point methods, unbalanced optimal transport, and neural network training. We use these examples to illustrate four ways in which geometry plays key yet fundamentally different roles in optimization. The first part explores the benign …
-
Studies integrating geometry, probability, and optimization under convexity
… function with the computational complexity of an interior-point method to solve a homogeneous conic system. (iii) Moreover, we develop a family of pre-conditioners based on the symmetry function and projective transformations for such interior-point method.
-
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 …
Page 1 of 5