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 50 for “"Linear complementarity problem"”.
-
Kernel-Based Interior-Point Algorithms for the Linear Complementarity Problem
In this thesis, we consider the Linear Complementarity Problem (LCP), which is a well-known mathematical problem with many practical applications. The objective of the LCP is to find a certain vector that will satisfy a set of linear inequalities and (non-linear) complementary equation. A …
-
Full Newton Step Interior Point Method for Linear Complementarity Problem Over Symmetric Cones
… 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 parameters we prove the global …
-
Path-Following Interior Point Method With Improved Iteration Bounds For Monotone Linear Complementarity Problem
… point method (IPM) algorithm to solve a monotone linear complementarity problem (LCP). A new eligible kernel function will be used to help improve the theoretical iteration bounds for the path-following IPM algorithm. IPM algorithms have two types of updates called large-step updates and …
-
On solving the vertical generalized linear complementarity problem associated with a vertical block P-matrix
… was developed to solve the vertical generalized linear complementarity problem (VGLCP) when the associated matrix is a vertical block P-matrix (VBP). The objective of this study is to implement the algorithm on a large scale using the Python programming language. We also use a Python code to …
-
Complementarity and related problems
In this thesis, we present results related to complementarity problems. We study the linear complementarity problems on extended second order cones. We convert a linear complementarity problem on an extended second order cone into a mixed complementarity problem on the non-negative orthant. We …
-
Equitable Efficiency in Multiple Criteria Optimization
… especially designed to solve multiple criteria problems having commensurate criteria where different criteria values can be compared directly. In this dissertation we study some theoretical and practical aspects of equitably efficient solutions. The literature on equitable efficiency is not very …
-
Special topics in cone complementarity
… in the ambient space. Then we present the mixed complementarity problem on a general close, and convex cone can be solved by using an iterative method based on the isotonicity property of MESOC. Meanwhile, a numerical example has been illustrated to show the applicability of MESOC. We also …
-
A finite characterization of K-matrices in dimensions less than four
… matrices M, known as K-matrices, for t which the linear complementarity problem w-Mz=q, w≥O, z≥O, w<sup>t</sup>z=O has a solution whenever w-Mz=q, w≥O, z≥O has a solution is characterized for dimensions n<4. The characterization is finite and"practical". Several necessary conditions, sufficient …
-
Nonlinear Computer Analysis of Reinforced Concrete Frames
… of a computer program called NACF for the nonlinear analysis of reinforced concrete framed structures. The inelastic analysis is formulated as a linear complementarity problem. The computer program that was developed, can be used to perform the complete analysis of a reinforced concrete frame …
-
Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems
… 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 are forced to stay in the …
-
Infeasible Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems
… 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 are forced to stay in the …
-
Rigid body simulation with contact and constraints
… of Ascher and Chin, but is formulated as a linear complementarity problem, allowing us to solve for the stabilization step when there are redundant inequality (contact) constraints. As an application of our simulation software, we present a method for human character animation where motion …
-
ΥΠΟΛΟΓΙΣΜΟΣ ΚΑΙ ΑΝΑΛΥΣΗ ΚΙΝΗΤΗΣ ΜΕΤΑΛΛΙΚΗΣ ΑΡΠΑΓΗΣ ΡΟΜΠΟΤ
… BEHAVIOUR OF THE SYSTEM IS CONSIDERED AND THE PROBLEM IS FORMULATED AS A LINEAR COMPLEMENTARITY PROBLEM. IN THE CASE WHERE THE FRICTION PHENOMENON IS INCLUDED, THE FORMULATION COVERS THE TWO TYPES OF FINGERS: HARD AND SOFT. THE CONCEPTS OF FORM-AND FORCE-CLOSURE ARE USED AS QUALITY CRITERION …
-
Underlying paths and local convergence behaviour of path-following interior point algorithm for SDLCP and SOCP
… interior point method for monotone semidefinite linear complementarity problem (SDLCP) and second order cone programming (SOCP). Using this definition, we show the existence of off-central path for SDLCP for general direction. Restricting to a particular direction, we analyse a simple SDP example …
-
Improved Full-Newton-Step Infeasible Interior-Point Method for Linear Complementarity Problems
… 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 consisted of one feasibility step and some …
-
Minimal modeling of multi-point contact with friction for a dexterous manipulator
… during manipulation can be calculated using the linear complementarity problem (LCP) and the penalty/augmented Lagrange multiplier method. The LCP formulation and the Lagrange multiplier method add extra complication to the problem at hand and solution convergence is not guaranteed. In this paper …
Page 1 of 3